Question: 1.Suppose you only know Dijkstra's shortest path algorithm. Can you still use it in some innovative way to accomplish the same goal as that of
1.Suppose you only know Dijkstra's shortest path algorithm. Can you still use it in some innovative way to accomplish the same goal as that of all-pairs shortest path algorithm?
2.If you are asked to find a minimum spanning tree starting from a specific vertex, between Prim and Kruskal algorithm, which one you should choose? Explain your answer.
Step by Step Solution
3.49 Rating (156 Votes )
There are 3 Steps involved in it
1 Using Dijkstras Algorithm for AllPairs Shortest Path While Dijkstras algorithm is primarily design... View full answer
Get step-by-step solutions from verified subject matter experts
