如何利用Dijkstra计算次短路径

最新推荐文章于 2020-06-08 11:52:23 发布

原创最新推荐文章于 2020-06-08 11:52:23 发布 · 2.7k 阅读

0 ·

CC 4.0 BY-SA版权

网络专栏收录该内容

14 篇文章

订阅专栏

本文探讨了如何使用Dijkstra算法的拓展应用来计算KShortestPath最短路径及次短路径。通过移除原始最优解中的单条边，重新计算得到次优路径，并按顺序排列展示。该方法为解决实际问题中对多路径需求提供了有效手段。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

利用Dijkstra可以计算最短路径，那么次短路径和次次短路径呢，下面wiki说明了实现方法，与之前自己的想象一致。

来源：wiki：http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Related problems and algorithms[edit]

The functionality of Dijkstra's original algorithm can be extended with a variety of modifications. For example, sometimes it is desirable to present solutions which are less than mathematically optimal. To obtain a ranked list of less-than-optimal solutions, the optimal solution is first calculated. A single edge appearing in the optimal solution is removed from the graph, and the optimum solution to this new graph is calculated. Each edge of the original solution is suppressed in turn and a new shortest-path calculated. The secondary solutions are then ranked and presented after the first optimal solution.

计算K Shortest Path最短路径还有专门的方法：

http://en.wikipedia.org/wiki/K_shortest_path_routing