带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm

A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node

In computer science, the Floyd–Warshall algorithm (also known as Floyd s algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm[clarification needed]) is a graph analysis algorithm for finding shortest paths in a weighted graph