Question

Explain briefly the dijkstra's algorithm for finding the shortest path.

Answer 1

Answer:

⇉ Dijkstra finds the shortest path from only one vertex, Floyd-Warshall finds it between all of them. Use the Floyd-Warshall algorithm if you want to find the shortest path between all pairs of vertexes, as it has a (far) higher running time than Dijkstra's algorithm