栅格数据模型中附有条件的最短路径算法

Shortest path algorithm confined to conditions in grid data model

将附有条件的最短路径概括为点约束、边约束和属性约束的最短路径问题。以栅格数据模型为图或网络描述方式,基于贪心算法思想,提出栅格数据模型中附有条件的最短路径算法。最后,通过实例进行了算法测试,结果表明栅格数据模型中附有条件的最短路径算法是完全可行和有效的。

The shortest path question confined in conditions was generalized as the shortest path question confined to point set, the shortest path question confined to edge set, and the shortest path question confined to attribute set. The shortest path algorithm confined to conditions in grid data mode was put forward. In this algorithm, graphic or network was expressed by grid data model, based on greedy idea. In the end, the algorithm was validated by examples. It is shown that the shortest path algorithm confined to conditions in grid data model is completely feasible and effective.