Search - shortest path in map

Search - shortest path in map - List

[Other resource] park_guide DL : 0: 公园导游图给出一张某公园的导游图（景点不少于10个），游客通过终端询问可知：任一景点的相关信息；从某一景点到另一景点的最短简单路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。要求： 1、从键盘或文件输入导游图； 2、游客通过键盘选择两个景点，输出结果； 3、输出从入口到出口的最佳路线。文件中包含详细的源代码及注释,以实现这个经典的问题。-park guide map is a park guide Zhang plan (not less than 10 spots), tourists asked through a terminal known : as an attraction of relevant information; From a certain attraction to the other attractions of the shortest simple path. Tourists from the door into the park, an election the best route, so that tourists can not repeat visit to the attractions, Finally back to exports (on the export side entrance). Requirements : one from the keyboard or file input guide map; Two tourists through the keyboard to choose two spots, output; 3. output from the entrance to export the best route. Document contains a detailed source code and the Notes in order to achieve this classic problem.
Date : 2008-10-13 Size : 1.58kb User : agang
[Other resource] wuhan-traffic DL : 1: 一、目的：对应数据结构课程所学的基本原理和方法，学习图状结构求最短路径的算法，将理论知识运用于实际。二、任务：请根据附图和附表，设计一个武汉市交通导引系统。用户输入起点站和目标站，系统显示起点站到目标站的最短路径。三、要求： 1. 提示用户输入起点站和目标站 2. 系统向用户显示一条最短路径（经过站数最少的路线），如果有两条以上最短路线，则按换乘次数排序显示。 3. 显示每一条路线时，不仅要显示应搭乘的车次，还要显示应搭乘站的站名。四、提示：将每一站的权值设定为1，可以使用Dijkstra算法实现。 -one purpose : Corresponding data structure courses are taught the basic principles and methods learning map structure for the shortest path algorithm, the actual application of theoretical knowledge. Two tasks : According to the attached map and schedule, design a Wuhan city traffic guidance system. User input starting point and goal of stations, the system shows starting point to the target point is the shortest path. 3, asked : 1. prompt the user input starting point and goal of Station 2. System users to show a shortest path (at least after a few stops the line ), if there are more than two shortest routes, according to the number of transfer order shows. 3. To show a line, not only to show that the vehicles should take, but also indicate that it should be traveled Station in name. 4, T
Date : 2008-10-13 Size : 168.19kb User : 李明
[Other resource] Dijkstra_TA DL : 0: 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。 -data structure of the classic experimental procedure. In major cities across the country to the vertex, the railway linking the edge of the map, as the weighted distance, Design completed a search for the shortest path automatic system; input as the starting cities and urban target, the output for the shortest path and distance.
Date : 2008-10-13 Size : 777.25kb User : 王斐
[Other resource] campusNavigate DL : 0: 校园导航程序，数据结构中图的利用的典型例子（我的一次课程实验源代码），本代码用C语言编写；基本功能： 1.校园景点信息的查询功能。 2.校园景点最短路径查询功能。（求图的最小路径）-campus navigation procedures, the data structure using the map of a typical example (I once Experimental source code), The code in C language; basic functions : 1. Campus Information attractions inquiry. 2. Shortest Path campus attractions inquiry. (For the minimum path)
Date : 2008-10-13 Size : 9.9kb User : ARK
[Other resource] Genetic最短路径 DL : 0: 在vc控制台中运行，用遗传算法求解最短路径，用邻接矩阵表示路线图。-in vc console operations, Genetic Algorithm for the shortest path, adjacency matrices road map.
Date : 2008-10-13 Size : 122.88kb User : rabo