文件名称:mindistance
介绍说明--下载内容来自于网络,使用问题请自行百度
最短路径算法源码,很多人需要的。本人载网站开发gis,游自编的最短路径查询程序,速度特快,3万节点,35000条路全部遍历,只需1秒。现将最短路径的思路告诉大家,希望大家在优化,并用不同语言编制,我正在学delphi,准备用delphi做成库,本例以由拓扑关系的arc/info 文件为数据源。其中a1,b1,c1是以fnode排序生成的数组,a1对应fnode,b1对应tnode,c1对应length,同样a2,b2,c2,是以tnode 生成的数组。Indexa1是对应某一起点与其相连的终点的个数,indexb1时对应某一终点与其相连的起点的个数,即其拓扑关系。
-shortest path algorithm source, a lot of people in need. I gis contained web site development, Yu directed the shortest path query procedures, speed express routes, 30,000 nodes, all 35,000 traverse the road, only a seconds. Now Shortest Path tell you the idea that we should optimization, and use different language, delphi is studying, I wanted to use delphi caused basement, in the cases from the arc topology / info file as the data source. Which a1, b1, c1 fnode ranking is generated by the array, a1 fnode counterparts, b1 counterparts tnode, c1 corresponding length, the same a2, b2, c2, tnode is generating array. Indexa1 counterparts is a starting point, linked with the end of the number, indexb1 counterparts at a terminal connected to its starting point the number, which is its topologic
-shortest path algorithm source, a lot of people in need. I gis contained web site development, Yu directed the shortest path query procedures, speed express routes, 30,000 nodes, all 35,000 traverse the road, only a seconds. Now Shortest Path tell you the idea that we should optimization, and use different language, delphi is studying, I wanted to use delphi caused basement, in the cases from the arc topology / info file as the data source. Which a1, b1, c1 fnode ranking is generated by the array, a1 fnode counterparts, b1 counterparts tnode, c1 corresponding length, the same a2, b2, c2, tnode is generating array. Indexa1 counterparts is a starting point, linked with the end of the number, indexb1 counterparts at a terminal connected to its starting point the number, which is its topologic
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最短路径算法源码(VB).htm
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.