With the following graph Single Source Shortest Path algorit…
With the following graph Single Source Shortest Path algorithm (Dijkstra’s algorithm) as discussed in class: and weighted edge data like this: Use vertex 3 as the starting vertex to run the Dijkstra’s algorithm. What’s the conent of the cost vector parent vector Show me the shortest path (a sequence of vertex indices) from 3 to 0 is , and the cost is to 1 is , and the cost is to 2 is , and the cost is to 4 is , and the cost is