最短路问题的通用算法——最短初等链法

The shortest simple chain method for solving shortest path problem

最短初等链法是求解网络图最短路问题的通用算法,它突破了以往诸算法的局限性,适用范围广,具有广阔应用前景。

The shortest simple chain method is a versatile algorithm for solving the shortest path problem on network graph. In contrast to the existing methods, it can be applied to various shortest path problems on graph, so that there will be a more widely application.