KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I am reading up on Dijkstra's algorithm and the Floyd-Warshall algorithm. I understand that Dijkstra's finds the optimal route from one node to all other nodes and Floyd-Warshall finds the optimal route for all node pairings. My question is would Dijkstra's algorithm be more efficient than Floyd's if I run it on every single node in order to find the optimal route between all pairings. Dijkstra's runtime is O(E + VlogV) where Floyd's is O(V 3 ). If Dijkstra's fails, what would its runtime be in this case? Thanks!
Tags (comma-separated)
Save Edits
Cancel