Algoritmos | Graficar las rutas más cortas | Pregunta 13

Une el siguiente

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