Question 1 (15 points)
Listen
Write a program that reads a connected graph from a file. The graph is stored in a file
and the contents are displayed below.
Your program should prompt the user to enter the name of the file, then two
vertices, and should display a shortest path between the two vertices.
// Connected graph file contents are below; file is called testgraph.txt
// Note, the first entry indicates the number of vertices
12
0, 1, 807 | 0, 3, 1331 | 0, 5, 2097
1, 2, 381 | 1, 3, 1267
2, 3, 1015 | 2, 4, 1663 | 2, 10, 1435
3, 4, 599 | 3, 5, 1003
4, 5, 533 | 4, 7, 1260 | 4, 8, 864 | 4, 10, 496
5, 6, 983 | 5, 7, 787
6, 7, 214
7, 8, 888
8, 9, 661 | 8, 10, 781 | 8, 11, 810
9, 11, 1187
10, 11, 239
// Take a deep breath, this is 30 ish lines of code