Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

UGC-NET | UGC NET CS 2018 July – II | Question 24

  • Last Updated : 06 Sep, 2018

Which of the following algorithms solves the single-source shortest paths?
(A) Prim’s algorithm
(B) Floyd – Warshall algorithm
(C) Johnson’s algorithm
(D) Dijkstra’s algorithm

Answer: (D)

Explanation: Dijkstra’s algorithm solves the single-source shortest paths.
For more information on Dijkstra’s algorithm please ReferDijkstra’s shortest path algorithm
Option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!