Location:
Search - SHORTEST-PATHS
Search list
Description: 北京交通大学校园旅游导航系统，利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
Platform: |
Size: 315319 |
Author: 陈勋 |
Hits:
Description: A*算法解决找路径的问题，对于特定的图形，按照距离最短的评估函数，来解决寻优问题-A * algorithm to find paths to solve the problems that specific graphics, in accordance with the shortest distance from the assessment function, to solve the optimization problem
Platform: |
Size: 23096 |
Author: zx |
Hits:
Description: 的克斯查最短路径分析的c代码实现，可以手工输入路径矩阵并得到两点路径。-investigation of Vieques analysis of the shortest path to achieve c code can be entered manually path matrix and the following two paths.
Platform: |
Size: 28871 |
Author: 李化 |
Hits:
Description: 北京交通大学校园旅游导航系统，利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
Platform: |
Size: 315392 |
Author: 陈勋 |
Hits:
Description: 求解最优交通路径，程序预置部分城市间距离，由用户选择两个城市，计算出两城市间最短路径和相应路线。-Optimal traffic paths, procedures preset distance between some cities, by the user to choose two cities to calculate the shortest path between two cities and the corresponding line.
Platform: |
Size: 2048 |
Author: bellinwater |
Hits:
Description: [实验目的]
1. 熟悉图的存储结构
2. 掌握图的最短路径算法
[实验内容]
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
[实验要求]
1 查询各景点的相关信息；
2 查询图中任意两个景点间的最短路径。
3 查询图中任意两个景点间的所有路径。
-[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths.
Platform: |
Size: 4096 |
Author: 王建媚 |
Hits:
Description: 这是一个交通咨询系统，可以列出两个城市之间的所有路径，还可以查找两个城市之间的最短路径-This is a traffic advisory system, between the two cities can list all the paths, but also between the two cities to find the shortest path
Platform: |
Size: 2048 |
Author: 杨小强 |
Hits:
Description: In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
Platform: |
Size: 2048 |
Author: jazz |
Hits:
Description: 程序开始运行时显示一个迷宫地图，迷宫中央有一只老鼠，迷宫的右下方有一个粮仓。游戏的任务是使用键盘上的方向键操纵老鼠在规定的时间内走到粮仓处。要求：1）老鼠形象可辨认，可用键盘操纵老鼠上下左右移动；2）迷宫的墙足够结实，老鼠不能穿墙而过；3）正确检测结果，若老鼠在规定时间内走到粮仓处，提示成功，否则提示失败；4）添加编辑迷宫功能，可修改当前迷宫，修改内容：墙变路、路变墙；5）找出走出迷宫的所有路径，以及最短路径。利用序列化功能实现迷宫地图文件的存盘和读出等功能-The beginning of the proceedings that a maze run-time map of the Central Authorities have a mouse maze, the maze of the lower right corner there is a granary. Game s mission is to use the arrow keys on the keyboard to manipulate the mouse within the required timeframe Department went granary. Requirements: 1) rats recognizable image that can be used to manipulate the keyboard or move the mouse up and down 2) strong enough wall maze, rats can not pass through walls 3) the correct test results, if the mice in the granary came within a specified time, the prompt success, failure or tips 4) to add functionality to edit the maze to modify the current maze of changes: changing the way the wall, the wall changed the way 5) to identify all the paths out of the maze, as well as the shortest path. Sequence of functions using the maze map and save the document to read out the functions of
Platform: |
Size: 8192 |
Author: xiliting |
Hits:
Description: 用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。
要求：(1)查询各景点相关信息；
(2)查询图中任意两个景点的最短路径。
(3)查询图中任意两个景点的所有路径。
--Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main attractions, storage spots number, name, profile and other information. Requires the ability to answer questions about attractions introduction, tour passing by and so on. Requirements: (1) check the relevant information sites (2) query graph the shortest path between any two spots. (3) The query graph for all paths of any two spots.
Platform: |
Size: 4096 |
Author: yangyong |
Hits:
Description: 最短路径分析，基于arcgis engine有例子路径数据-The shortest path analysis, there are examples of data paths
Platform: |
Size: 1818624 |
Author: quqi |
Hits:
Description: 迷宫问题，有详细的注释，实现了自己设置入口出口，可找所有路径和最短路径并输出所有路径-Maze problem, there are detailed notes, to achieve its own entrance exit he could find all the paths and the shortest path and the output of all paths
Platform: |
Size: 2048 |
Author: 朱科圣 |
Hits:
Description: 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。
要求事先一下功能：
（1） 查询各顶点的相关信息。
（2） 查询图中任意两个景点之间的最短路径。
（3） 查询图中任意两个景点之间的所有路径。
--Free to the net means that the school campus attractions in your plans, the graph vertices of their main attractions, storage spots number, name, profile and other information, the graph edges, said the road between sites, storage path length information. Requested in advance what functions: (1) query the vertex of the relevant information. (2) query graph between any two sites the shortest path. (3) The query graph between any two spots of all paths.
Platform: |
Size: 519168 |
Author: 欧阳云飞 |
Hits:
Description: 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。
要求事先一下功能：
（1） 查询各顶点的相关信息。
（2） 查询图中任意两个景点之间的最短路径。
（3） 查询图中任意两个景点之间的所有路径。
--Free to the net means that the school campus attractions in your plans, the graph vertices of their main attractions, storage spots number, name, profile and other information, the graph edges, said the road between sites, storage path length information. Requested in advance what functions: (1) query the vertex of the relevant information. (2) query graph between any two sites the shortest path. (3) The query graph between any two spots of all paths.
Platform: |
Size: 520192 |
Author: 欧阳云飞 |
Hits:
Description: 用VC编写的电脑鼠走迷宫，能走出所有路径，并找出最短路径-VC' s computer with a mouse maze, to get out all the paths, and find the shortest path
Platform: |
Size: 6144 |
Author: stt |
Hits:
Description: 适用于APSP(All Pairs Shortest Paths，多源最短路径)，是一种动态规划算法，稠密图效果最佳，边权可正可负。此算法简单有效-floyd All Pairs Shortest Paths
Platform: |
Size: 1024 |
Author: 周创 |
Hits:
Description: Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.[1][2]
The algorithm exists in many variants Dijkstra s original variant found the shortest path between two nodes,[2] but a more common variant fixes a single node as the source node and finds shortest paths the source to all other nodes in the -Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.[1][2]
The algorithm exists in many variants Dijkstra s original variant found the shortest path between two nodes,[2] but a more common variant fixes a single node as the source node and finds shortest paths the source to all other nodes in the
Platform: |
Size: 1024 |
Author: Dharmesh |
Hits:
Description: Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph
Platform: |
Size: 4096 |
Author: manas |
Hits:
Description: 任意两点间最短路算法
Warshall-Floyd算法思想，最短距离矩阵+任意给定两顶点的最短路所包含顶点。(The shortest path algorithm between any two points
The idea of Warshall-Floyd algorithm, the shortest distance matrix + the shortest path contained by any given two vertex is the vertex.)
Platform: |
Size: 2048 |
Author: SARAH寒 |
Hits:
Description: Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密()
Platform: |
Size: 3072 |
Author: ZA$00917 |
Hits: