1 votes 1 votes Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _______, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a ________. Greedy algorithm, Divide-conquer algorithm Divide-conquer algorithm, Greedy algorithm Greedy algorithm, Dynamic programming algorithm Dynamic programming algorithm, Greedy algorithm Algorithms ugcnetcse-dec2014-paper3 algorithms shortest-path + – makhdoom ghaya asked Jul 28, 2016 • recategorized Nov 10, 2017 by Sanjay Sharma makhdoom ghaya 3.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Dijkstra algorithm, which solves the single-source shortest--paths problem, is a Greedy algorithm, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a Dynamic programming algorithm. C is ans. Prashant. answered Jul 28, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.