Python!!!You will solve the single source shortest path problem for a directed weighted graph with no negative edges using Dijkstra's Algorithm.

Read a directed weighted graph $G$ from an input file.

An example graph is provided below.

The first line of the file contains $n,$ the number of vertices of $G.$ The names of the vertices are the integers from $1$ to $n.$

Each remaining line of the graph is a list of integers separated by spaces and represents the list of neighbors of one vertex.

The first number in the line is the name of the vertex.

After that, a sequence of pairs consists of a vertex name and a weight.

The source will be vertex $1.$

You are to print the shortest path from the source to each other vertex.

There will be at most $100$ vertices in the graph.

Provide your working code along with the screenshots of various inputs and outputs.

Example input: