# Category:Dijkstra's algorithm

From LiteratePrograms

Dijkstra's algorithm is a graph algorithm that simultaneously finds the **shortest path** from a single vertex in a weighted graph to all other vertices in the graph, called the single-source shortest path problem. It works for directed and undirected graphs, but unlike the Bellman-Ford algorithm, requires nonnegative edge weights.

If the edge weights are all fixed and equal, a better solution is Category:Breadth-first search.

If the graph is embedded in the plane, as the roads on a map, and just a path between two points is desired, a better solution is Category:A* search.

## Pages in category "Dijkstra's algorithm"

The following 3 pages are in this category, out of 3 total.