Leon has drawn the undirected, weighted graph below: 8 2 2 5 4 6 8 2 b h Use Dijkstra's algorithm to find the shortest d

[answerhappygod]

Leon Has Drawn The Undirected Weighted Graph Below 8 2 2 5 4 6 8 2 B H Use Dijkstra S Algorithm To Find The Shortest D 1 (88.04 KiB) Viewed 27 times

Leon has drawn the undirected, weighted graph below: 8 2 2 5 4 6 8 2 b h Use Dijkstra's algorithm to find the shortest distance from vertex a to vertex i. Give your answer as an integer. Number Please enter the first 5 edges that were chosen during your application of Dijkstra's algorithm. This will be used to award partial marks if your answer above is wrong. Specifiy your edges using the names of the endpoints, such as "fg" for the edge between fand g. 1st edge 2nd edge 3rd edge 4th edge 5th edge