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.

Time complexity O(k·V·(V+E) log V), gograph function path.KShortest.

How it works

A navigation app rarely shows one route. It offers the quickest and two or three others that aren't much slower, so the driver can avoid a bridge or a busy street. Yen's algorithm finds the k quickest routes that don't repeat a vertex. It takes the quickest route, then at each vertex along it blocks the road that route takes from there, and the roads the routes found before take from the same start of the route, and finds the quickest way around. Each way around is a candidate, and the quickest candidate is the next route.

gograph runs it with Lawler's change: a route only branches from the vertex where it left the route it came from, so the vertices before that are never searched again and no route is found twice. It keeps at most k-1 candidates, since no more can be used, and skips a detour that can't beat the slowest of them.

Each detour search is A* guided by the exact time from each vertex to the goal, found once by one backward search at the start. Blocking roads only makes routes slower, so that guess never says more than the time left. Time is O(k·V·(V+E) log V) in the worst case, and the detours stay short in practice.

path.KShortest returns the routes without their costs, so the page adds up the minutes itself. Fewer than k routes is not an error, and k below 1 returns ErrInvalidK. On a street grid, many of the quickest routes differ by a single block, so the page shows how much of each route it shares with the first.

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 are the three quickest drives from Canal St & Broadway to Court St & Joralemon St that don't pass the same place twice, and how much slower is each one than the first?

The three quickest drives from Canal St & Broadway to Court St & Joralemon St take 5.22, 5.26 and 5.34 minutes. Route 2 is 0.04 minutes slower and shares 82% of route 1's time. Route 3 is 0.12 minutes slower and shares 98% of route 1's time.

Step by step

  1. First, one search backward from Court St & Joralemon St finds the exact time to it from each of the 295 vertices Canal St & Broadway reaches: 295 of them can get there. Each detour search uses that time as its guess, and blocking roads only makes routes slower, so the guess never says more than the time left.
  2. An A* search from Canal St & Broadway finds the quickest route, 5.22 minutes, after taking 16 vertices from its queue. It is the first candidate.
  3. Route 1 is the quickest candidate: 5.22 minutes.
  4. Detour from Canal St & Broadway: block Canal St & Broadway to Canal St & Lafayette St, the road the route takes from here. An A* search from Canal St & Broadway, at 0 minutes so far, takes 17 vertices from its queue and finds a way around: a candidate of 5.4 minutes.
  5. Detour from Canal St & Lafayette St: block Canal St & Lafayette St to Centre St & Canal St, the road the route takes from here, and Canal St & Broadway before Canal St & Lafayette St so the detour can't loop back. An A* search from Canal St & Lafayette St, at 0.29 minutes so far, takes 16 vertices from its queue and finds a way around: a candidate of 5.35 minutes.
  6. Detour from Centre St & Canal St: block Centre St & Canal St to Canal St & Walker St, the road the route takes from here, and Canal St & Broadway and Canal St & Lafayette St before Centre St & Canal St so the detour can't loop back. An A* search from Centre St & Canal St, at 0.42 minutes so far, takes 2 vertices from its queue and finds no way around quicker than the slowest candidate kept, 5.4.

19 more steps lead to the last one:

  1. Done. The three quickest routes take 5.22, 5.26 and 5.34 minutes.

Use it in Go

routes, err := path.KShortest(g, "Canal St & Broadway", "Court St & Joralemon St", 3, nil)
if err != nil {
	return err
}
for _, route := range routes {
	minutes := 0.0
	for i := 1; i < len(route); i++ {
		minutes += g.GetEdge(route[i-1], route[i]).Weight()
	}
	fmt.Println(minutes, len(route))
}

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.
  • 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.
  • 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