Answers are grounded in this paper and cite their sources.
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n + kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery.
No takes yet. Share an insight, caveat, or question.
David Eppstein (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: