Which of the following algorithms solves the single-source shortest paths ?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. Dijkstra’s algorithm
Explanation
Dijkstra solves single-source shortest paths. Prim builds MSTs; Floyd–Warshall and Johnson solve all-pairs.
More Data Structures and Algorithms questions
- A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The opt…
- A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with…
- Match the following with respect to algorithm paradigms :
- The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number) :
- A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes wil…
- Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is…