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.