Dijkstra's algorithm
Download as PPTX, PDF1 like779 views
Dijkstra's algorithm is a solution to the single-source shortest path problem in graph theory. It finds the shortest paths from a source vertex to all other vertices in a weighted graph where all edge weights are non-negative. The algorithm uses a greedy approach, maintaining a set of vertices whose final shortest path from the source vertex has already been determined.
Dijkstra's algorithm
- 2. Single-Source Shortest Path Problem Single-Source Shortest Path Problem - The problem of finding shortest paths from a source vertex v to all other vertices in the graph. 2
- 3. Dijkstra's algorithm Dijkstra's algorithm - is a solution to the single-source shortest path problem in graph theory. Works on both directed and undirected graphs. However, all edges must have nonnegative weights. Approach: Greedy Input: Weighted graph G={E,V} and source vertex v∈V, such that all edge weights are nonnegative Output: Lengths of shortest paths (or the shortest paths themselves) from a given source vertex v∈V to all other vertices 3
- 4. Dijkstra's algorithm - Pseudocode 4
- 20. Dijkstra Animated Example-2 Shortest Path from A to H, A to C, C to D, D to E, E to G, G to F, F to H 20
- 21. End 21