Browse
•
Categories
•
Random
Dijkstra's algorithm
Duration: 2 minutes, 51 seconds
Related Topics:
Like
Dijkstra's algorithm
, the
Bellman-Ford algorithm
solves the single-source shortest paths problem.
Dijkstra's algorithm
uses a
priority queue
, which may be implemented as a
heap
.
Dijkstra's algorithm
takes
O
(V log V + E) time.
Category:
Graph algorithms
References:
Cormen, Thomas H., et al.
Introduction to Algorithms
. 2nd ed. Cambridge: MIT Press, 2001.
Tags:
Dijkstra's algorithm, weighted graph, directed graph, shortest path, single-source shortest paths, relax, edge relaxation, graph algorithm, computer science animations, computer programming, Flash, learn computer science, study computer science
Home
•
About
•
Links
© 2008 - 2023 Bill Jacobs
