基于.NET和MapXtreme的公交查询系统的设计与实现

Design and realization of bus query system based on .NET and MapXtreme

本文详细介绍了基于.NET框架、利用MapXtreme二次开发组件,设计和实现多种情况下的公交换乘查询算法的过程,提出了公交查询系统的解决方案。其中,在数据表的设计上建立了路段与站点的一种一一对应关系的拓扑关系,简化了站点和线路查询的实现过程。在最优换乘方案的设计上采用的是一种基于树形结构的遍历算法,具有较强的实用价值。

This article detailed introduces how to make use of the MapXtreme as second developing tools to design and realize the arithmetic of bus change query under various instances Based on. NET. When designing the datasheet, it builds u Pthe corresponding topology relationshi Pbetween road segments and stations to simplify the design process of station query and bus line query, when designing the best bus change plan, it uses a traversing arithmetic based on a tree structure, which has practical significance.