混合步长网络漫游最短路算法

网络最短路问题一直是运筹学的重要研究课题之一，本文针对现有网络最短路算法的民不足，提出了网络最短路问题的一种新算法－－混合步长网络漫游法，该方法既具有Ｔ－Ｐ标号法的简易性，又具有适应负路权的特性，而且便于手工表上作业，本文探讨了该垢原理、算法和特点，并就该法的手工表上作业进行了实例演示，最后提出了作者要进一步解决的问题。

Mixed-steps Network Roam Minimum Path Algorithm

Network minimum path is one of the important questions to be studied about Operation Re-search. This thesis is directed against the superiority and insufficient about network minimum path algorithm.A new algorithm for network minimum path problem---mixed-steps network roam method was studied. Thealgorithm not only possess simple and easy of the T-P symbol but also possess the characteristic adapted tonegative distance and easy to handwork table operation. The principle, algorithm and characteristics of themethod were inquired into. And the handwork table operation of the method was demonstrated by example.In last the problems to be resolved further of the method was raised.