0 6 22 27 24 16 21 17 18 1 28 G S 5 9 15 26 13 20 19 12 8 14 H N 7 23 10 25 Consider the graph given above. Use Dijkstra
Posted: Sat May 21, 2022 10:15 am
0 6 22 27 24 16 21 17 18 1 28 G S 5 9 15 26 13 20 19 12 8 14 H N 7 23 10 25 Consider the graph given above. Use Dijkstra's algorithm to find the shortest path between H and R. a. List the vertices in the order they are visited as specified by the algorithm. S,M,1,0 b. What is the total weight along the path? 30