Question

Dijkstra's algorithm,which solves the single source shortest path problem ,is a

Answer 1

Answer:

Explanation:

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

Answer 2

Answer:

Dynamic programming algorithm

1 Answer. 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.