网络中λ阶短路径的构造原则及算法

A Constructive Principle and Algorithm of λ Level Short Path in Network

分析由延长而产生的前导和后继路径阶的生成关系,获得λ阶短路径的构造原则,然后根据构造原则,修改最短路径D(Dijkstre)算法,提出λ阶短路径D算法,并用算例验证算法的可行性.

By analyzing the generative relation of leader path and successor path, the constructive principle of λ level short path is obtained. Then according to the constructive principle, the shortest path D algorithm（Dijkstre algorithm） is modified and D algorithm of λ level short path is propose. Finally, samples was used to prove the feasibility of algorithm.