如何用算法指南解决图论中的长尾词最短路径问题？
- 内容介绍
- 文章标签
- 相关推荐
本文共计122个文字，预计阅读时间需要1分钟。
如图所示：+graph+LRstart%5B最短路径%5D---+simple%5B单源最短路径%5Dstart+---+multi%5B多源最短路径%5Dsimple+---+have_negative%7B是否有负权边%7Dhave_negative+--+Yes%7B是%7D---+dijkstra%5BDijkstra算法%5Ddijkstra+---+usual%5B朴素Dijkstra算法%5DO(n^2)%5Ddijkstra+end+
如图所示
graph LR
start[最短路] --- simple[单源最短路]
start --- multi[多源最短路]
simple --- have_negative{是否有负权边}
have_negative -- Yes --- dijkstra[Dijkstra算法]
dijkstra --- usual[朴素Dijkstra算法 O n^2]
dijkstra --- heap_dijkstra[堆优化版Dijkstra算法 O mlogn]
have_negative -- No --- algorithm[some algorithm]
algorithm --- bellman_ford[Bellman-Ford O nm]
algorithm --- spfa[SPFA 一般Om 最坏Onm]
multi --- floyd[Floyd算法 O n^3]
本文共计122个文字，预计阅读时间需要1分钟。
如图所示：+graph+LRstart%5B最短路径%5D---+simple%5B单源最短路径%5Dstart+---+multi%5B多源最短路径%5Dsimple+---+have_negative%7B是否有负权边%7Dhave_negative+--+Yes%7B是%7D---+dijkstra%5BDijkstra算法%5Ddijkstra+---+usual%5B朴素Dijkstra算法%5DO(n^2)%5Ddijkstra+end+
如图所示
graph LR
start[最短路] --- simple[单源最短路]
start --- multi[多源最短路]
simple --- have_negative{是否有负权边}
have_negative -- Yes --- dijkstra[Dijkstra算法]
dijkstra --- usual[朴素Dijkstra算法 O n^2]
dijkstra --- heap_dijkstra[堆优化版Dijkstra算法 O mlogn]
have_negative -- No --- algorithm[some algorithm]
algorithm --- bellman_ford[Bellman-Ford O nm]
algorithm --- spfa[SPFA 一般Om 最坏Onm]
multi --- floyd[Floyd算法 O n^3]