Search - shortest path

Search - shortest path - List

[Windows Develop] HolyMoley DL : 0: 本软件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法，具有非常广的应用前景，越来越多的人开始学习蚁群算法，因此本软件也有推广前景。本软件除了用于教学目的外，还可用于解决实际生活中的与TSP（即，旅行商问题）问题相关的问题。 TSP问题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。 -the software used to help computer enthusiasts Ant learning algorithm to do the ant colony algorithm tests. Ant Algorithm as a good new algorithm has a very broad application prospects, more and more people begin to learn ant colony algorithm, the software also promote the prospects. In addition to the software for teaching purposes, can also be used to solve real life with TSP (ie, the traveling salesman problem) issues related issues. TSP is a description of the TSP to several cities, each city must go only to one that once such conditions are met the shortest path. Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems.
Date : 2008-10-13 Size : 1.28kb User : 李誉
[Windows Develop] 全国交通咨询系统 DL : 0: 一　题目全国铁路交通咨询系统二　需求分析 1.系统配制：硬件：CPU：P4 1.6G 内存容量 256M 标准输入输出设备软件：操作系统Windows xp 源程序调试工具VC6.0 可执行文件运行工具 DOS 5.0. 2.该系统有供用户选择的菜单和交互性。 3.建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。三　设计概要 1.抽象数据类型本程序运用了关于图这种数据结构。他的抽象数据类型定义如下： typedef struct unDiGraph { int numVerts //结点 costAdj cost //邻接矩阵 }unDiGraph,*UNG 基本操作： unDiGraph* CreateCostG() 操作结果：构造带权(费用)图。 unDiGraph* CreateTimeG() 操作结果：构造带权（时间）图。 PathMat *Floyed(unDiGraph *D) 操作结果：Floyed函数求任意两点的最短路径。 -a subject of the national railway traffic advisory system analysis of a two needs. Preparation System : Hardware : CPU : P4 1.6 GHz 256 MB of memory standard input and output device software : Windows XP operating system source code debugging tools VC6.0 executable file running DOS 5 tools. 0. 2. The system is available for users to choose the menu and interactive. 3. The establishment of a national rail traffic advisory system, the system automatically search with arbitrary two inter-city rail traffic and the shortest path to the function at the lowest cost. Three design an outline. This abstract data type procedures on the use of this data structure map. His abstract data type is defined as follows : typedef struct (int unDiGraph numVerts / / node costAdj cost / / adjacency matrix) unDiG
Date : 2008-10-13 Size : 55.6kb User : gang
[Windows Develop] mindistance DL : 0: 最短路径算法源码，很多人需要的。本人载网站开发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
Date : 2008-10-13 Size : 2.36kb User : x
[Windows Develop] PshortPM DL : 0: 狄克斯特拉算法（从一个顶点到其余各顶点的最短路径）-neering algorithm (from a peak of the peak of the rest of the shortest path)
Date : 2008-10-13 Size : 93.56kb User : 萌音
[Windows Develop] zuiduanlujing2006 DL : 0: VB写的Dijkstra最短路径选择算法-VB wrote Dijkstra shortest path algorithm
Date : 2008-10-13 Size : 15.04kb User : 李家
[Windows Develop] Dijistra最短路径二维数组结构 c++ DL : 0: Dijistra最短路径二维数组结构 c-Dijistra Shortest Path 2D array structure c
Date : 2025-12-31 Size : 1kb User : 阿宝
[Windows Develop] vb_Mapinfo_ShortPath DL : 0: GIS源代码 (MAPX 最短路径算法）-GIS source code (MAPX shortest path algorithm)
Date : 2025-12-31 Size : 175kb User : leo
[Windows Develop] Mapinfo20060527 DL : 0: 在地图上显示最短路径的mapinfo二次开发源码，功能不是很强大，因为刚开始学GIS！-on the map shows the shortest path MapInfo Second Development source, function is not very strong, because just started to learn GIS!
Date : 2025-12-31 Size : 165kb User :
[Windows Develop] SJ5_6 DL : 0: 弗洛伊德算法--最短路径文件上穿为.cpp格式-Floyd algorithm-- the shortest path to wear paper. Cpp format
Date : 2025-12-31 Size : 2kb User : wang
[Windows Develop] TherealizationgofFloydarithmetibymatlab DL : 0: 用MATLAB仿真工具实现Floyd算法，求任意两端间的最短路径-MATLAB simulation tool used to achieve Floyd algorithm, for any shortest path between two ends
Date : 2025-12-31 Size : 2kb User : 布布
[Windows Develop] 73462665DRAc DL : 0: 路由算法最短路径路由算法大家多多分享-Shortest path routing algorithm routing algorithm everybody a lot to share
Date : 2025-12-31 Size : 2kb User : xianxu
[Windows Develop] GisPathFinder DL : 0: 自动实现最短路径的程序，图形显示。纯 vb语言实现，没有其他组件-Automatically realize the shortest path procedures, graphical display. Net vb language realize, there is no other component
Date : 2025-12-31 Size : 28kb User : aa
[Windows Develop] kk4 DL : 0: 最短路径代码这是一个网络下载的代码在VB。net 可以试运行-The shortest path code is a network to download the code in VB. net can try running
Date : 2025-12-31 Size : 5kb User : hlx
[Windows Develop] AStar DL : 0: 如何找到一条最短的路径是程序员需要设计的算法，目前最为流行的寻路算法就是A*算法，这个就是A*算法的一个简单例子-How to find a shortest path is programmers need to design algorithms, is currently the most popular routing algorithm is the A* algorithm, this is the A* algorithm is a simple example
Date : 2025-12-31 Size : 319kb User : cn
[Windows Develop] shortest DL : 0: Map of the shortest path algorithm for dynamic programming
Date : 2025-12-31 Size : 33kb User : 陈剑
[Windows Develop] ASTAR245.ZIP DL : 0: A*算法机器人路径单机器人路径多机器人路径规划算法-A* algorithm for robot path of a single robot path to multi-robot path planning algorithm
Date : 2025-12-31 Size : 24kb User : lynn
[Windows Develop] ALG_K_ShortPath DL : 0: this a program to count the shortest path in a graph-this is a program to count the shortest path in a graph
Date : 2025-12-31 Size : 378kb User : nitadewi
[Windows Develop] tsp DL : 0: 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
Date : 2025-12-31 Size : 3kb User : hbk hsu
[Windows Develop] Algorithm-shortest-way-in-graph DL : 0: Shortest Path Algorithms in Graphs
Date : 2025-12-31 Size : 153kb User : mazik
[Windows Develop] the-shortest-road DL : 0: 求最短路径的方法，算法复杂度非常低且算法具有创新性-Method for the shortest path, the complexity of the algorithm is very low and the algorithm innovative
Date : 2025-12-31 Size : 1kb User : 张立娇

« 12 3 4 5 6 7 8 9 10 »