Open In App

Algorithms | Graph Shortest Paths | Question 13

Like Article
Like
Save Article
Save
Share
Report issue
Report

Match the following

Group A                                                Group B
a) Dijkstra's single shortest path algo p) Dynamic Programming
b) Bellmen Ford's single shortest path algo q) Backtracking
c) Floyd Warshell's all pair shortest path algo. r) Greedy Algorithm
(A) a-r, b-q, c-p
(B) a-p, b-p, c-p
(C) a-r, b-p, c-p
(D) a-p, b-r, c-q


Answer: (C)

Explanation: Dijkstra is a greedy algorithm where we pick the minimum distant vertex from not yet finalized vertices.

Bellman Ford and Floyd Warshell both are Dynamic Programming algorithms where we build the shortest paths in bottom up manner.

Quiz of this Question


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads