本人载网站开发gis,游自编的最短路径查询程序，速度特快，3万节点，35000条路全部遍历，只需1秒。现将最短路径的思路告诉大家，希望大家在优化，并用不同语言编制，我正在学delphi,准备用delphi做成库，本例以由拓扑关系的arc/info 文件为数据源。其中a1,b1,c1是以fnode排序生成的数组，a1对应fnode,b1对应tnode,c1对应length,同样a2,b2,c2,是以tnode 生成的数组。Indexa1是对应某一起点与其相连的终点的个数，indexb1时对应某一终点与其相连的起点的个数，即其拓扑关系。-I set website development gis, shortest path traveled own inquiry procedure, the speed of an express, 30,000 nodes, 35,000 all ergodic Road, just 1 second. The idea of the shortest path to tell everybody, I hope everyone in the optimization, and use different languages, I was learning delphi, made ready to use delphi library, in this case by the topological relations between the arc/info file for the data source. Which a1, b1, c1 is generated fnode array sort, a1 corresponding fnode, b1 corresponds tnode, c1 corresponds to length, the same a2, b2, c2, is generated tnode array. Indexa1 is a starting point corresponding to its number of connected endpoints, indexb1 corresponds to a particular destination when its connected to the starting point for the number, that is, their topological relations.