Description: 图的一种算法,实现图里所有节点间最短路径,然后输出到一个文件里,即包含输入输出文件,请用test 工作区-a map algorithm, and all nodes in Ituri between the shortest path, and then output to a file, includes input and output documents, please use the test work area Platform: |
Size: 61180 |
Author:杨锐 |
Hits:
Description: 对一个运输商来说要把货运到收货地点选择最短的路线运输是其实现最大利润的要求，那么怎样选择最短的运输路线呢？在运输交通图中，我们设每一个城市为一个结点（vertextype类型）点并把他们分别用关键字代表（关键字int key ），也就是说把每个城市给出一个整数编码；一个城市直接到另一个城市的交通路线为边且这两个城市为相邻结点，不妨设这条路线的距离为边的权值（权值int weight ），易知距离越短运费就越低。这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。-right to run a transport freight to the place of receipt to choose the shortest route transportation is the biggest achievement of their profits to the request, then how to choose the shortest route? In the transportation plan, We set up a city for every one node (vertextype type) and point them were used on behalf of the keyword (keyword int key), each city is given an integer coding; one city to another city direct traffic routes to the edge and the two neighboring cities nodes, may wish to set up this line of the distance between the edge weights (weights int weight), Yi known as short distance from the lower the freight. This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl Platform: |
Size: 2781 |
Author:kmisong |
Hits:
Description: 一、 目的：
对应数据结构课程所学的基本原理和方法，学习图状结构求最短路径的算法，将理论知识运用于实际。
二、 任务：
请根据附图和附表，设计一个武汉市交通导引系统。用户输入起点站和目标站，系统显示起点站到目标站的最短路径。
三、 要求：
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 Platform: |
Size: 172227 |
Author:李明 |
Hits:
Description: 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。
-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. Platform: |
Size: 795903 |
Author:王斐 |
Hits:
Description: 用JAVA写的最短路径算法(在GIS开发尤其是WEBGIS开发中非常有用！)-using Java to write the shortest path algorithm (especially in the development of GIS development of WEBGIS is very useful!) Platform: |
Size: 258048 |
Author:崔振磊 |
Hits:
Description: 校园导游图，包括选择最短路径，选择不同景点，不同参观顺序。-campus tour map, including the choice of the shortest path, choose a different attractions, visited different order. Platform: |
Size: 1961984 |
Author:郝平 |
Hits:
Description: 根据城市交通路网建设的实际, 研究了描述城市交通网络图的城市道路数据库的组织结构, 在此数据
结构的基础上依靠G IS 技术的支持, 采集了大量具体道路信息, 采用D ijk st ra 算法实现了快速最短路径搜索。根
据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻, 给出了一个搜索实例——一个包
含61 个交通路口的最短路径搜索结果的搜索时间约为1. 1-Urban traffic network in accordance with the actual building, research describing the urban traffic of the urban road network structure of the database, in this data structure based on G IS techniques rely on the support, collecting a large number of specific road information, the use of D ijk st ra algorithm to achieve a fast shortest path search. According to city traffic conditions on the transport network map boundary value given different weights to achieve optimal path search, a search examples are given- one that contains 61 traffic junctions of the shortest path search results of the search time is about 1. 1 Platform: |
Size: 183296 |
Author:王功臣 |
Hits:
Description: 图的算法的基本训练
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information. Platform: |
Size: 7168 |
Author:bueaty |
Hits:
Description: 分别用floyd 和dijkstra算法计算城市间最短路径的简单例子，地图由固定格式的文件输入，参考压缩包中的sample.txt,地图文件名要作为main参数-Floyd were Dijkstra algorithm and the shortest path between cities in the simple example, the map by a fixed format file input, reference compression package sample.txt, map file name to as a main parameter Platform: |
Size: 7168 |
Author:吕婉辰 |
Hits:
Description: In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this.-In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this. Platform: |
Size: 70656 |
Author:kassi |
Hits:
Description: AspMap是一个小巧的webgis控件，支持高性能的AJAX。能够生成地图图片，专题，最短路径，车载跟踪，政府地理信息网站，在本文件中含有这些源码。安装后可以用C sharp和vb.net运行。
修改系统日期为10年后
安装本目录中的 aspmap4.3
装好把系统日期恢复
这是因为这个软件是免费试用版，把日期推后10年后安装，
再改为正确的日期可试用期长达10年。
-AspMap is a small webgis control, support for high-performance AJAX. Able to generate map images, thematic, shortest path, vehicle tracking, the government geographic information website, in the present document contains the source code. After installation you can run with C sharp and vb.net.
Platform: |
Size: 10546176 |
Author:红信 |
Hits:
Description: 求一个图的最短路径的问题，程序在dos的界面下运行 程序还输出了最短路径的问题-Find a map of the shortest path problem, the program interface run in the dos program also outputs the shortest path problem Platform: |
Size: 210944 |
Author:马浩原 |
Hits:
Description: 数据结构中的交通图咨询程序，能让旅客咨询从任一城市顶点到另一城市顶点之间的最短路径（里程）或最低花费或最少时间等问题。对于不同咨询要求，可输入城市间的路程或所需时间或所需费用。-Traffic map in the data structures in the consultation process that allows the Visitor Information from the culmination of any one city to another city the shortest path between the vertices (mileage) or minimum spend or at least time. For different consultation requirements, can enter the distance between the cities or the time required or cost.
Platform: |
Size: 2048 |
Author:王龙飞 |
Hits:
Description: 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。
代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non recursive way, great help for learning data structures. Code all their own understanding of their own to write, the idea is consistent with the beginners. Platform: |
Size: 797696 |
Author:wafer |
Hits:
Description: 蚁群算法在机器人路经规划中MATLAB栅格地图求得最短路径(Robot path planning MATLAB ant colony algorithm to find the shortest path in the grid map) Platform: |
Size: 4096 |
Author:万古
|
Hits:
Description: ArcGIS二次开发最短路径，基于VS的ArcGIS二次开发，实现地图查找两点之间最短路径功能(The shortest path in the secondary development of ArcGIS and the second development of ArcGIS based on VS realize the function of searching the shortest path between two points in a map.) Platform: |
Size: 84992 |
Author:啧，要不得 |
Hits:
Search - shortest path in map