ARC／INFO路径寻找功能的拓展：双向比较追索法

The Extension of the ARC/INFO Pathfinding Function: The Tracing Algorithm of Two-way Comparison

针对ＡＲＣ／ＩＮＦＯ软件路径寻找功能只能在弧－节点数据模式上实现的局限，以公交网络为例，提出了双向比较追索法．这一算法解决了公交网络上最小成本路径的确定问题，从而将路径寻找功能拓展到动态段数据模式．

Considered the limitation that ARC/INFO Pathfinding function only works on ArcNode Data Model, the paper discusses the case of public transportation network (PTN) and presents the tracing algorithm of two-way comparison. And the pathfinding function is extended to the Dynamic Segmentation Data Model. Therefore, a solution to the problem of the minimum cost path on PTN is provided.