526
个编辑
更改
→Finding paths 路径寻找
Several algorithms exist to find shortest and longest paths in graphs, with the important distinction that the former problem is computationally much easier than the latter.
Several algorithms exist to find shortest and longest paths in graphs, with the important distinction that the former problem is computationally much easier than the latter.
求解图的最短路径和最长路径的均有多种算法，但是前者的计算比后者简单得多。
'''<font color="#ff8000">Dijkstra 算法</font>'''产生了一个从源顶点到无向或有向图中每个顶点的最短路径列表，而'''<font color="#ff8000">Bellman-Ford 算法</font>''' 可以应用于具有负边权重的有向图。利用'''<font color="#ff8000"> Floyd-Warshall 算法</font>'''可以求出加权有向图中所有顶点对之间的最短路径。
'''<font color="#ff8000">Dijkstra 算法</font>'''产生了一个从源顶点到无向或有向图中每个顶点的最短路径列表，而'''<font color="#ff8000">Bellman-Ford 算法</font>''' 可以应用于具有负边权重的有向图。利用'''<font color="#ff8000"> Floyd-Warshall 算法</font>'''可以求出加权有向图中所有顶点对之间的最短路径。
== See also 另请参见==
== See also 另请参见==