UGC NET JULY 2018 (Computer Science And Applications Paper-II) (Question 24)
Solution:
Q 24. Which of the following algorithms solves the single-source shortest paths?
- Prim's algorithm
- Floys-Warshall algorithm
- Johnson's algorithm
- Dijkstra's algorithm
Solution:
- Prim's algorithm => Min Cost spanning tree
- Floys-Warshall algorithm => All pair shortest path
- Johnson's algorithm => All pair shortest path
- Dijkstra's algorithm => Single source shortest path
0 comments:
Post a Comment