Discussion Forum
Que.  Dijkstra algorithm, which solves the singlesource shortestpaths problem, is a_______________, and the FloydWarshall algorithm, which finds shortest paths between all pairs of vertices, is a _____________. 
a.  Greedy algorithm, Divideconquer algorithm 
b.  Divideconquer algorithm, Greedy algorithm 
c.  Greedy algorithm, Dynamic programming algorithm 
d.  Dynamic programming algorithm, Greedy algorithm 
Answer:Dynamic programming algorithm, Greedy algorithm 
71000434158 :(October 17, 2019)
c is correct

Click to Add Comment 