最短初等链法是求解网络图最短路问题的通用算法，它突破了以往诸算法的局限性，适用范围广，具有广阔应用前景。
In respect to the shortest path problem of the weighed direct graph, the iterative method of minimum algebra is established.
最短初等链法是求解网络图最短路问题的通用算法，它突破了以往诸算法的局限性，适用范围广，具有广阔应用前景。
In respect to the shortest path problem of the weighed direct graph, the iterative method of minimum algebra is established.
应用推荐