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.

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

How it works

Bidirectional search runs two Dijkstra searches at once: one forward from the start and one backward from the goal. Each step takes the vertex with the smaller time from the two queues, so the two sides grow at the same pace. Each side covers about half the distance, so on a road map it looks at a fraction of what one search would. Routing engines use it on its own and under faster methods such as contraction hierarchies.

The search from the goal follows edges in reverse: on a directed graph it walks the edges that lead into a vertex, so a one-way street that leads into the goal is taken backward from the goal. Each time one side reaches a vertex the other side has reached, the two times add up to a route, and the search keeps the quickest one it has found.

It can't stop the moment the two sides first touch, since a quicker route can pass through vertices neither side has settled. It stops once the two smallest times left in the queues add up to no less than the best route: any route not found yet goes through a vertex still in a queue and takes at least that long.

path.Bidirectional takes the edge cost as a function, and a nil cost uses the edge weight. A negative cost returns ErrNegativeWeight, and a goal the start can't reach returns ErrUnreachable. Ties break by the order vertices and edges were added, so the same graph gives the same route on every run.

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.

What is the quickest drive from I23 to I18, when most streets are one way and the search from I18 has to follow them in reverse?

The quickest drive from I23 to I18 takes 26 minutes, along 7 streets.

Step by step

  1. Search forward from I23 and backward from I18 at once. Each side has its own queue, ordered by time from its end, and each round settles the vertex with the smaller time of the two.
  2. The next times are 0 from the start and 0 from the goal: 0 + 0 = 0, and no route is known yet, so go on. Settle I23 from the start at 0.
  3. I23 to I14: 0 + 3 = 3.
  4. I23 to I22: 0 + 5 = 5.
  5. I23 to I24: 0 + 5 = 5.
  6. I23 to I32: 0 + 5 = 5.

55 more steps lead to the last one:

  1. Stop: the next times, 12 from the start and 14 from the goal, add up to 26, no less than the best route, 26, so no route left to find can be quicker. The quickest route meets at I17 and takes 26 minutes. The searches settled 18 vertices from the start and 5 from the goal.

Use it in Go

route, minutes, err := path.Bidirectional(g, "I23", "I18", nil)
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.
  • 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.
  • 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