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.

Metro region

A hundred towns, T1 to T100, where T stands for town, numbered row by row from the top left with ten to a row. Two fast motorways cross at T45: one runs from T41 to T50, the other through T5, T15 and on down to T95. Local roads join neighboring towns, a few of them one way, and each edge is the travel time in minutes.

A directed, weighted graph with 100 vertices and 346 edges.

What is the quickest drive from T45 to T100, taking the motorways where they help, and how many towns does the search look at?

The quickest drive from T45 to T100 takes 37 minutes, along 10 streets. path.DijkstraPaths finds the same time by settling all 100 vertices T45 can reach.

Step by step

  1. Every time starts at ∞, except T45, which is 0. The guess of the time left is the straight-line distance to T100 at the fastest any street on the drawing goes between its two ends, so it never says more than the true time. From T45 it is 12.0293 minutes, so T45 goes in the queue at 0 + 12.0293 = 12.0293.
  2. Take T45 from the queue: 0 minutes so far plus a guess of 12.0293 to go makes 12.0293, the lowest in the queue.
  3. T45 to T35: 0 + 2 = 2. The guess from T35 is 13.2033, so T35 goes in the queue at 2 + 13.2033 = 15.2033.
  4. T45 to T44: 0 + 3 = 3. The guess from T44 is 13.3872, so T44 goes in the queue at 3 + 13.3872 = 16.3872.
  5. T45 to T46: 0 + 3 = 3. The guess from T46 is 10.9335, so T46 goes in the queue at 3 + 10.9335 = 13.9335.
  6. T45 to T55: 0 + 2 = 2. The guess from T55 is 11.0214, so T55 goes in the queue at 2 + 11.0214 = 13.0214.

223 more steps lead to the last one:

  1. Take T100 from the queue at 37 minutes. That's the goal, so the quickest route there is known, and A* stops. It settled 78 vertices, where Dijkstra settles 100 by the time it reaches T100.

Use it in Go

goal := where["T100"]
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, "T45", "T100", 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