Dijkstra
Finds the shortest distance from a start vertex to every other vertex when no edge weight is negative.
Time complexity O((V+E) log V), gograph function path.DijkstraPaths.
path.Dijkstra returns the same distances as a map, without the routes.
How it works
Dijkstra's algorithm gives the start a distance of 0 and every other vertex a distance of infinity, and keeps the vertices in a priority queue by distance. It takes the closest vertex out, which makes its distance final, and checks each edge from it. When the path through that vertex is shorter than a neighbor's current distance, the neighbor takes the shorter distance, and the edge it came by becomes its way in.
This works because no edge weight is negative. Once a vertex is the closest one left, no later path can reach it for less. With a negative edge that stops being true, and Bellman-Ford is the one to use. path.DijkstraPaths keeps one entry per vertex in a binary heap and moves it up when a shorter path turns up, so it costs O((V+E) log V). It goes on until every vertex it can reach is settled.
Distance and PathTo on its result give each distance and the route there, start first, and report false for a vertex the start can't reach, so there's no infinity to compare with. Of two routes that are equally short, it keeps the one it found first, and vertices at the same distance leave the queue in the order of the edges that reached them, so the same graph gives the same routes on every run.
path.Dijkstra returns the distances alone, with math.MaxFloat64 for a vertex it can't reach, and path.DijkstraSimple returns them with a plain list and a linear scan instead of a heap, in O(V²). The performance card on this page times all three on each example graph.
One-way city
Forty-five intersections, I1 to I45, where I stands for intersection, numbered row by row from the top left with nine to a row. Most streets are one way, and the outer streets form a clockwise loop. Only the middle row (I19 to I27) and the middle column (I5, I14, I23, I32 and I41) go both ways, and each edge is the travel time in minutes.
A directed, weighted graph with 45 vertices and 88 edges.
How many minutes is the quickest drive from I23 to each intersection, when most streets are one way?
From I23, the shortest distances are 3 to I14, 5 to I22, 5 to I24, 5 to I32, 7 to I13, 7 to I25, 7 to I31, 8 to I5, 8 to I21, 9 to I15 and 34 more. The farthest is I18, at 26.
Step by step
- Every distance starts at ∞, except I23, which is 0. Put I23 in the queue.
- Take I23 from the queue. Its distance, 0, is now final.
- I23 to I14: 0 + 3 = 3, so I14's distance becomes 3. Put I14 in the queue.
- I23 to I22: 0 + 5 = 5, so I22's distance becomes 5. Put I22 in the queue.
- I23 to I24: 0 + 5 = 5, so I24's distance becomes 5. Put I24 in the queue.
- I23 to I32: 0 + 5 = 5, so I32's distance becomes 5. Put I32 in the queue.
93 more steps lead to the last one:
- Done. Every distance from I23 is final.
Use it in Go
paths, err := path.DijkstraPaths(g, "I23")
if err != nil {
return err
}
minutes, ok := paths.Distance("I2")
if !ok {
return nil // out of reach
}
route, _ := paths.PathTo("I2")
fmt.Println(minutes)
for _, v := range route {
fmt.Println(v.Label())
}
Example graphs
- New York streets, 295 vertices and 669 edges
- London streets, 274 vertices and 598 edges
- San Francisco streets, 248 vertices and 548 edges
- Rasht streets, 298 vertices and 568 edges
- School run, 6 vertices and 13 edges
- Delivery area, 8 vertices and 12 edges
- Downtown grid, 20 vertices and 60 edges
- One-way city, 45 vertices and 88 edges
- Metro region, 100 vertices and 346 edges
More in Shortest paths
- A*: Finds the quickest route from one vertex to another, looking first where a guess of the time left says the goal is, so it settles far fewer vertices than Dijkstra.
- Bidirectional search: Finds the quickest route from one vertex to another by searching forward from the start and backward from the goal at once, until the two searches meet.
- k shortest paths: Finds the k quickest routes from one vertex to another that don't repeat a vertex, quickest first, the way a navigation app offers a few routes.
- Beam search: Looks for a route from one vertex to another while keeping only the few best partial paths at each step, so its memory and time stay bounded, at the cost of sometimes missing the best route.
- Multi-source Dijkstra: Finds the nearest of several sources for every vertex, and the distance from it, in one search.
- k-center: Chooses k centers so that the vertex farthest from its nearest center is as near as it can make it.
- Bellman-Ford: Finds the shortest distance from a start vertex to every other vertex, even with negative weights, and reports a negative cycle when the start can reach one.
- Floyd-Warshall: Finds the shortest distance between every pair of vertices, even with negative weights, by letting paths stop at one more vertex in each round.