What is the difference between Dijkstra's algorithm and Floyd's algorithm?

Answer 1

Dijkstra doesn't support negative weight-age, Floyd support negative edges but no negative cycles. Dijkstra running time is v2 and Floyd has v3.Dijkstra is fast compared to Floyd, because only find the shortest path for single node. FloydSlow as compared to Dijkstra.

Answer 2

My (shallow) understanding is that while in Dijkstra you are trying to find the shortest path from a starting node to a given destination, in Floyd's you looking for the shortest path between any pair of nodes. The other major difference is that in Dijkstra you are not allowed to have negative weights/costs while you are allowed to have negative weights in Floyd. In the end they achieve the same objective if you wish to move from node A to node Z the main difference is that in Floyds you probably use the principle of dynamic programming(?).