Implement Dijkstra's algorithm with an input file C++

The instructions for how the graph is given and how the output should look is in the picture below. The input must be taken from a text file.

Ignore the last part about "and the optional second part will be the path from the start to the end vertex." The output should show the weight of the shortest path.

Implement Dijkstra's Algorithm Input Plaintext file with a lot of lines . The first line lists the vertices in the graph . The second line lists the start vertex and end vertex . The third through last lines of the file list the edges and associated weights a,b,c,d a, C a, b, 2 c,b,4 a, c, 7 c,d, 8 c,c,1 which corresponds to the graph 2 7 Output Output (up to) two lines to stdout. The required first line will be the weight, and the optional second line will be the path from the start to the end vertex. In the example above, this will be: 6 Implement Dijkstra's Algorithm Input Plaintext file with a lot of lines . The first line lists the vertices in the graph . The second line lists the start vertex and end vertex . The third through last lines of the file list the edges and associated weights a,b,c,d a, C a, b, 2 c,b,4 a, c, 7 c,d, 8 c,c,1 which corresponds to the graph 2 7 Output Output (up to) two lines to stdout. The required first line will be the weight, and the optional second line will be the path from the start to the end vertex. In the example above, this will be: 6