附有条件的最短路径算法

THE SHORTEST PATH ALGORITHM WITH CONSTRAINTS

分析目前最短路径算法特点和存在问题,并讨论附有条件的最短路径问题。以邻接矩阵为数据存储结构,在迪杰斯特拉(Dijkstra)最短路径算法的基础上,提出了附有条件的最短路径算法。最后,通过实例进行算法测试和比较。算法测试表明:附有条件的最短路径算法是完全可行和有效的。

The characteristics and the problems of existing shortest path algorithms are analyzed. The shortest path with constraints is discussed. In this paper it puts forward a shortest path algorithm with constraints, which is based on Dijkstra algorithm and uses adjacency matrix as data storage structure. In the end of the paper, the related algorithms were tested and compared in real example. It is shown by the result that the shortest path algorithms with constrains is completely feasible and available.