Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
k shortest path routing
open-in-new
<p>The <i>k</i> shortest path routing problem is a generalization of the <a href="/facts/Shortest-path_routing/g4nsrswr">shortest path routing problem</a> in a given <a href="/facts/Network_theory/m6CQovwm">network.</a> It asks not only about a shortest path but also about next <i>k−1</i> shortest paths (which may be longer than the shortest path). A variation of the problem is the loopless <i>k</i> shortest paths. </p><p>Finding <i>k</i> shortest paths is possible by extending <a href="/facts/Dijkstra%27s_algorithm/ehun88jl">Dijkstra's algorithm</a> or the <a href="/facts/Bellman%E2%80%93Ford_algorithm/Sx6INcdr">Bellman-Ford algorithm</a>. </p>