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.

London streets

The main roads of central London from Westminster to the City, from OpenStreetMap, with the bridges over the Thames to Southwark and Waterloo. Each intersection is named after its streets, one-way streets go one way, and each edge is the minutes to drive it at the speed limit, or at 20 to 32 km/h by road type where the map has no limit.

A directed, weighted graph with 274 vertices and 598 edges.

Map data © OpenStreetMap contributors.

How many minutes is the quickest drive from Trafalgar Sq & Strand in Westminster to Tower Bridge Rd & Tooley St across the Thames?

The shortest distance from Trafalgar Sq & Strand to Tower Bridge Rd & Tooley St is 8.37. The run also finds the distance to the other 272 vertices Trafalgar Sq & Strand can reach.

Step by step

  1. Every distance starts at ∞, except Trafalgar Sq & Strand, which is 0. Put Trafalgar Sq & Strand in the queue.
  2. Take Trafalgar Sq & Strand from the queue. Its distance, 0, is now final.
  3. Trafalgar Sq & Strand to St Martin's Pl & Charing Cross Rd: 0 + 0.37 = 0.37, so St Martin's Pl & Charing Cross Rd's distance becomes 0.37. Put St Martin's Pl & Charing Cross Rd in the queue.
  4. Trafalgar Sq & Strand to Trafalgar Sq & Charing Cross: 0 + 0.12 = 0.12, so Trafalgar Sq & Charing Cross's distance becomes 0.12. Put Trafalgar Sq & Charing Cross in the queue.
  5. Take Trafalgar Sq & Charing Cross from the queue. Its distance, 0.12, is now final.
  6. Trafalgar Sq & Charing Cross to Northumberland Ave & Victoria Embankment: 0.12 + 0.72 = 0.84, so Northumberland Ave & Victoria Embankment's distance becomes 0.84. Put Northumberland Ave & Victoria Embankment in the queue.

593 more steps lead to the last one:

  1. Done. Every distance from Trafalgar Sq & Strand is final.

Use it in Go

paths, err := path.DijkstraPaths(g, "Trafalgar Sq & Strand")
if err != nil {
	return err
}
minutes, ok := paths.Distance("Tower Bridge Rd & Tooley St")
if !ok {
	return nil // out of reach
}
route, _ := paths.PathTo("Tower Bridge Rd & Tooley St")
fmt.Println(minutes)
for _, v := range route {
	fmt.Println(v.Label())
}

Example graphs

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.

All algorithms