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.

Time complexity O((V+E) log V), gograph function path.AStar.

How it works

A* is how a navigation app finds one route from A to B. It runs like Dijkstra, but it orders its queue by the time so far plus a guess of the time left to B. So it always looks first at the vertex that seems to lead to B soonest, and it stops as soon as B leaves the queue. Dijkstra orders by the time so far alone and spreads out in every direction alike.

The guess on this page is the straight-line distance to B divided by the fastest speed on the map: the most distance per minute between its two ends that any street covers. No route can beat a straight line at that speed, so the guess never says more than the true time, and the route A* returns is the quickest. A guess that can say more than the true time can return a slower route. The guess needs each vertex's place, which only works where the vertices have positions, such as on a map.

This guess is also consistent: it never drops by more than the time of the street between two vertices. Then each vertex leaves the queue once, and A* costs O((V+E) log V), less in practice, since it stops at B. gograph calls the guess at most once for each vertex and never for B. With a guess that isn't consistent, it can take a vertex out of the queue again when a quicker way to it turns up.

path.AStar takes the edge cost and the guess as functions. A nil cost uses the edge weight, and a nil guess makes it Dijkstra. A negative cost returns ErrNegativeWeight, and a goal the start can't reach returns ErrUnreachable. Landmarks, the ALT method, give a sharper guess than a straight line on road networks.

New York streets

The main streets of Lower Manhattan and Downtown Brooklyn, from OpenStreetMap, with the Brooklyn and Manhattan Bridges between them. 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 24 to 40 km/h by road type where the map has no limit.

A directed, weighted graph with 295 vertices and 669 edges.

Map data © OpenStreetMap contributors.

What is the quickest drive from Canal St & Broadway in Manhattan to Court St & Joralemon St in Brooklyn, and how much of the city does the search look at to find it?

The quickest drive from Canal St & Broadway to Court St & Joralemon St takes 5.22 minutes, along 15 streets. path.DijkstraPaths finds the same time by settling all 295 vertices Canal St & Broadway can reach.

Step by step

  1. Every time starts at ∞, except Canal St & Broadway, which is 0. The guess of the time left is the straight-line distance to Court St & Joralemon St at 66 km/h, the fastest any street on the map goes between its two ends, so it never says more than the true time. From Canal St & Broadway it is 2.848 minutes, so Canal St & Broadway goes in the queue at 0 + 2.848 = 2.848.
  2. Take Canal St & Broadway from the queue: 0 minutes so far plus a guess of 2.848 to go makes 2.848, the lowest in the queue.
  3. Canal St & Broadway to Broadway & Walker St: 0 + 0.19 = 0.19. The guess from Broadway & Walker St is 2.7898, so Broadway & Walker St goes in the queue at 0.19 + 2.7898 = 2.9798.
  4. Canal St & Broadway to Canal St & Lafayette St: 0 + 0.29 = 0.29. The guess from Canal St & Lafayette St is 2.7265, so Canal St & Lafayette St goes in the queue at 0.29 + 2.7265 = 3.0165.
  5. Canal St & Broadway to Canal St & W Broadway: 0 + 0.59 = 0.59. The guess from Canal St & W Broadway is 3.1034, so Canal St & W Broadway goes in the queue at 0.59 + 3.1034 = 3.6934.
  6. Take Broadway & Walker St from the queue: 0.19 minutes so far plus a guess of 2.7898 to go makes 2.9798, the lowest in the queue.

310 more steps lead to the last one:

  1. Take Court St & Joralemon St from the queue at 5.22 minutes. That's the goal, so the quickest route there is known, and A* stops. It settled 127 vertices, where Dijkstra settles 202 by the time it reaches Court St & Joralemon St.

Use it in Go

goal := where["Court St & Joralemon St"]
guess := func(v string) float64 {
	p := where[v]
	return math.Hypot(p[0]-goal[0], p[1]-goal[1]) / speed
}

route, minutes, err := path.AStar(g, "Canal St & Broadway", "Court St & Joralemon St", nil, guess)
if err != nil {
	return err // path.ErrUnreachable when the goal is out of reach
}
fmt.Println(minutes)
for _, v := range route {
	fmt.Println(v.Label())
}

Example graphs

More in Shortest paths

  • Dijkstra: Finds the shortest distance from a start vertex to every other vertex when no edge weight is negative.
  • 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