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

Bellman Ford algorithm for finding negative weight of the graph.

链路状态法，即bellman-ford算法-Link state law, that the bellman-ford algorithm