Graphs/Dijkstra

From charlesreid1

Revision as of 16:32, 9 September 2017 by Admin (talk | contribs)

Notes

Dijkstra's algorithm is a weighted breadth-first search. it uses a greedy heuristic to select the next edge. It works by starting with an empty "cloud" of vertices, and adds vertices to the cloud in order of their distance from s.

The end result of Dijkstra's algorithm is the length of the shortest distance (weighted path) from the source vertex s to all other vertices v on the graph G.


Flags



GraphFlag.png
Graphs
notes on graph theory, graph implementations, and graph algorithms

Part of Computer Science Notes

Series on Data Structures


Graphs


Graph Theory:

Graphs/Definitions  · Graphs/Matching  · Graphs/Connectivity

First Theorem of Graph Theory


Graph Implementations:

Graphs/Data Structures  · Graphs/ADT

Graphs/Java/Adjacency Map  · Graphs/Java/Adjacency Map Lite

Graphs/Guava


Graph Algorithms:

Algorithms/Graphs


Traversal:

Graphs/Traversal  · Graphs/Euler Tour  · Graphs/Depth First Traversal  · Graphs/Breadth First Traversal

Category:Traversal


Connectivity and Cycles:

Graphs/Finding Cycles  · Graphs/Finding Connected Components  · Graphs/Reachability


Transitive Closure:

Graphs/Transitive Closure  · Graphs/Floyd Warshall Algorithm


Shortest Path:

Graphs/Shortest Path  · Graphs/Edge Relaxation  · Graphs/Dijkstra


Minimum Spanning Tree:

Graphs/Minimum Spanning Tree  · Graphs/Prim Jarnik Algorithm  · Graphs/Kruskal Algorithm

Graphs/Cluster Finding


Directed Acyclic Graphs:

DAGs  · Graphs/Cycles  · Graphs/Topological Sort


Category:Graphs  · Category:Algorithms  · Category:CS  · Category:Data Structures


Flags  · Template:GraphsFlagBase  · e



Retrieved from "https://charlesreid1.com/w/index.php?title=Graphs/Dijkstra&oldid=21097"