摘要： 在对已有第K条最短路算法进行分析和比较的基础上提出了一种新的无环K路算法。该算法基于最短路计算，具有复杂度较低、收敛快以及无环等特点，在路由规划中的应用以及仿真分析都证明本算法是有效、实用的。

关键词: 第K条最短路算法, 二重扫除算法, 无环路, 路由规划

Abstract: This article presents a new loop-less K path algorithm based on the contrast and analysis of the existing K shortest path algorithms. This algorithm is based on the shortest path. It is simple and quick enough. The application to the route planning and the simulation of this algorithm both prove its validity and practicality.

中图分类号: 

• TP393.02