Description: 使用WIN API编写的图形界面版本的图中两点之间最短路径求解演示程序.VC6工程-use WIN API prepared by the graphical interface version of the map shortest path between two points for Demonstration Program. V C6 works Platform: |
Size: 12391 |
Author:JohnnyAnn |
Hits:
Description: 一些数据结构算法的例子，包括哈夫曼编码、图的表示、关键路径、最短路径等-Some examples of data structure algorithms, including Huffman coding, map, said the critical path, the shortest path, etc. Platform: |
Size: 7168 |
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: 在地图上显示最短路径的mapinfo二次开发源码，功能不是很强大，因为刚开始学GIS！-on the map shows the shortest path MapInfo Second Development source, function is not very strong, because just started to learn GIS! Platform: |
Size: 168960 |
Author: |
Hits:
Description: 本代码可以用于查找指定地图中点与点之间的最短路径，例如查找两站牌之间的最佳公交线路。-This code can be used to find the midpoint of the specified map with the shortest path between points, such as licensing between the two stations to find the best bus lines. Platform: |
Size: 7168 |
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: matalab的蚁群算法解最短路问题程序，并有运行图，修改后可用于机器人路径-ant colony algorithm matalab solution procedures for the shortest path problem and run the map, the modified robot path can be used Platform: |
Size: 33792 |
Author:李海民 |
Hits:
Description: 实现中国铁路最短路径的计算，基于图的PRIM算法，MFC实现动态演示-China Railway the shortest path to achieve the calculation of the PRIM algorithm based on the map, MFC dynamic presentation Platform: |
Size: 1961984 |
Author:zhangyan |
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: 校园导航系统，主要的工作是能够进行校园信息的相关服务和各种信息查询，最主要的是能够进行最短路径分析和选择-Campus navigation system, main job is to campus information related service and all kinds of information inquiry, the main reason is to analyze and select the shortest path Platform: |
Size: 6770688 |
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: 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 - map shortest path