网络中λ阶短路径的最小边序号法

The minimum edge number algorithm of λ order short path in network

将G(n,m)中各点的相邻边,按边权值大小排序成为有序边.所有点和边构成有序边延长矩阵Eyx.从始点开始选Eyx中相应序号为1的边延长;当点序列不能延长时,则后退到刚才延长边的前导点;如后退后仍不能延长,则继续后退;然后首先选比该前导点的已选延长边序号大于1的边延长,以后再选序号为1的边延长.反复操作,便可获得所需λ阶短路径(包括最短路径).

According to the weight, the adjacent edge of each node in G（n,m） is sorted into orderly edge.All the nodes and edges form orderly edge extended matrix Eyx.Choose edge extension of which the corresponding serial number is 1 in Eyxfrom the starting node.When node seguence cannot extend,back to forward-guide node of extended edge.If it still cannot extend,go back and back.Firstly choose the extended edge which is more selected extended edge number than 1 of this forward-guide node.Then choose edge extension of the number of 1.Again and again,it can get the λ level short path（including the shortest path）.