1.Suppose you only know Dijkstra's shortest path algorithm. Can you still use it in some innovative way...
Fantastic news! We've Found the answer you've been seeking!
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 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.
Related Book For
Strategic Management An Integrated Approach
ISBN: 978-1111825843
10th edition
Authors: Charles W. L. Hill, Gareth R. Jones
Posted Date: