Description: 最短路径算法源码，很多人需要的。本人载网站开发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 Platform: |
Size: 2416 |
Author:x |
Hits:
Description: 最短路径算法源码，很多人需要的。本人载网站开发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 Platform: |
Size: 2048 |
Author:x |
Hits:
Description: Ａ智能算法，是一个小型游戏，能够在有效的时间内找出最短的路径．-A smart algorithm, is a small game that can effectively find the shortest time path. Platform: |
Size: 193536 |
Author:baiyinan |
Hits:
Description: 基于Java多线程实现所有顶点间最短路径的并行算法-Java-based multi-threaded realize the shortest path between all vertices of the parallel algorithm Platform: |
Size: 135168 |
Author:john |
Hits:
Description: Dijkstra算法，Delphi语言实现，用来求解最短路-Dijkstra algorithm, Delphi language used for solving the shortest path Platform: |
Size: 3072 |
Author:王小涵 |
Hits:
Description: 本人载网站开发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. Platform: |
Size: 4096 |
Author:haogood |
Hits:
Description: A*算法寻找最短路径，对此感兴趣的可以下载来看一下-A* algorithm to find the shortest path, which can be downloaded interested look Platform: |
Size: 647168 |
Author:vccode |
Hits:
Description: Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output Platform: |
Size: 180224 |
Author:曹雷 |
Hits:
Description: 最短径路的一个算法源码，delphi7可以是使用，很不错的-The shortest path routing algorithm for a source, delphi7 can be used, very good Platform: |
Size: 17408 |
Author:song |
Hits:
Description: Source code for the freeware component - TDiff - written in
Borland s Delphi programming language. This component dramatically
simplify programming tasks that require calculations of shortest path or
longest common sequence as typically required in file compare utilities.-Source code for the freeware component - TDiff - written in
Borland s Delphi programming language. This component dramatically
simplify programming tasks that require calculations of shortest path or
longest common sequence as typically required in file compare utilities. Platform: |
Size: 558080 |
Author:Elcio |
Hits:
Description: Delphi的最短路径实现代码，Word文档显示，可用-The shortest path to achieve Delphi code, Word documents show available Platform: |
Size: 4096 |
Author:AgSun |
Hits:
Description: 数据结构中图的应用（最短路径以及拓扑排序）-The application in the data structure (shortest path and topological sorting) Platform: |
Size: 524288 |
Author:永夜 |
Hits:
Description: 一个DELPHI的A星算法源码PAS..可用于游戏等自动寻最短路径-DELPHI s a source PAS .. A star algorithm can be used to automatically find the shortest path games
Platform: |
Size: 3072 |
Author:朱超超 |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center outward expansion of the layers, until extended to the end so far. Dijkstra shortest path algorithm can arrive at the optimal solution, Platform: |
Size: 6144 |
Author:刘旭 |
Hits:
Description: 最短路径新算法，程序速度特快，3万节点，35000条路全部遍历，只需1秒。-New shortest path algorithm, the program speed of the express, 30,000 nodes, 35,000 road traversing all, just 1 second. Platform: |
Size: 6144 |
Author:罗 |
Hits:
Description: 用Delphi语言编程实现Voronoi图，这对于最短路径分析是很有用的-Delphi programming language with a Voronoi diagram, which for the shortest path analysis is useful Platform: |
Size: 258048 |
Author:余红楚 |
Hits:
Search - delphi shortest path