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.
Downtown grid
Twenty intersections on a downtown street grid. Streets go both ways, Market is closed to cars between 2nd and 3rd, and each edge is the travel time in minutes.
A directed, weighted graph with 20 vertices and 60 edges.
What are the three quickest drives from Pine & 1st to River & 5th that don't pass the same place twice, and how much slower is each one than the first?
The three quickest drives from Pine & 1st to River & 5th take 15, 16 and 17 minutes. Route 2 is 1 minute slower and shares 73% of route 1's time. Route 3 is 2 minutes slower and shares 0% of route 1's time.
Step by step
- First, one search backward from River & 5th finds the exact time to it from each of the 20 vertices Pine & 1st reaches: 20 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.
- An A* search from Pine & 1st finds the quickest route, 15 minutes, after taking 8 vertices from its queue. It is the first candidate.
- Route 1 is the quickest candidate: 15 minutes.
- Detour from Pine & 1st: block Pine & 1st to Pine & 2nd, the road the route takes from here. An A* search from Pine & 1st, at 0 minutes so far, takes 8 vertices from its queue and finds a way around: a candidate of 17 minutes.
- Detour from Pine & 2nd: block Pine & 2nd to Pine & 3rd, the road the route takes from here, and Pine & 1st before Pine & 2nd so the detour can't loop back. An A* search from Pine & 2nd, at 2 minutes so far, takes 7 vertices from its queue and finds a way around: a candidate of 17 minutes.
- Detour from Pine & 3rd: block Pine & 3rd to Pine & 4th, the road the route takes from here, and Pine & 1st and Pine & 2nd before Pine & 3rd so the detour can't loop back. An A* search from Pine & 3rd, at 5 minutes so far, takes 2 vertices from its queue and finds no way around quicker than the slowest candidate kept, 17.
10 more steps lead to the last one:
- Done. The three quickest routes take 15, 16 and 17 minutes.
Use it in Go
routes, err := path.KShortest(g, "Pine & 1st", "River & 5th", 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
- New York streets, 295 vertices and 669 edges
- London streets, 274 vertices and 598 edges
- San Francisco streets, 248 vertices and 548 edges
- Rasht streets, 298 vertices and 568 edges
- School run, 6 vertices and 13 edges
- Delivery area, 8 vertices and 12 edges
- Downtown grid, 20 vertices and 60 edges
- One-way city, 45 vertices and 88 edges
- Metro region, 100 vertices and 346 edges
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.