Question: v distTo[] edgeTo[] 0 infinity null 1 7.0 5 2 13.0 3 3 0.0 null 4 10.0 7 5 3.0 3 6 12.0 1 7

v distTo[] edgeTo[]
0 infinity null
1 7.0 5
2 13.0 3
3 0.0 null
4 10.0 7
5 3.0 3
6 12.0 1
7 8.0

The table below is created when applying Dijkstras shortest path algorithm to a graph with 8 vertices 0,1..,7. The table shows the shortest path tree (distTo and edgeTo) immediately after vertex 4 has been relaxed. Give the order in which the first five vertices were deleted from the minPQ.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!