赋权图上最短路径的一种简便算法

A simple solution to the shortest path problem of weighted graph

在不考虑负回路的前提下,给出了在含有负权的赋权图上求任意两点间最短路径的一种简便算法,此算法既适用于有向图又适用于无向图,并且可据此算法找到最短路径。

Without the negative circle, the next article put forwards a simple algorithm to the shortest path problem of weighted graph between any two points. This algorithm applies to both the digraph and applied to undirected graphs, and we can find the shortest path through this algorithm.