搜索资源列表
北京交通大学校园旅游导航系统
- 北京交通大学校园旅游导航系统,利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
实验题
- 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
ShortestPathUsingC
- 的克斯查最短路径分析的c代码实现,可以手工输入路径矩阵并得到两点路径。-investigation of Vieques analysis of the shortest path to achieve c code can be entered manually path matrix and the following two paths.
最短路径分析
- 最短路径分析,基于arcgis engine有例子路径数据,The shortest path analysis, there are examples of data paths
ShortestPathsEdge
- 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 sh
MazeGame
- 程序开始运行时显示一个迷宫地图,迷宫中央有一只老鼠,迷宫的右下方有一个粮仓。游戏的任务是使用键盘上的方向键操纵老鼠在规定的时间内走到粮仓处。要求:1)老鼠形象可辨认,可用键盘操纵老鼠上下左右移动;2)迷宫的墙足够结实,老鼠不能穿墙而过;3)正确检测结果,若老鼠在规定时间内走到粮仓处,提示成功,否则提示失败;4)添加编辑迷宫功能,可修改当前迷宫,修改内容:墙变路、路变墙;5)找出走出迷宫的所有路径,以及最短路径。利用序列化功能实现迷宫地图文件的存盘和读出等功能-The beginning of t
migong
- 迷宫问题,有详细的注释,实现了自己设置入口出口,可找所有路径和最短路径并输出所有路径-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
SchoolScenes_Guide
- 用无向网表示你所在学校的校园景点平面图,图中顶点表示主要景点,存放景点的编号、名称、简介等信息,图中的边表示景点间的道路,存放路径长度信息等。 要求事先一下功能: (1) 查询各顶点的相关信息。 (2) 查询图中任意两个景点之间的最短路径。 (3) 查询图中任意两个景点之间的所有路径。 --Free to the net means that the school campus attractions in your plans, the graph vertices of
bellman_for
- 无线传感器网络中发现从权有向图的定顶点的最短路径发现从权有向图的定顶点的最短路径- finds shortest paths a given vertex of a weighted directed graph
Shortest-Path
- 在网络通信中,经常需要求最短路径。但完全采用最短路径传输有这样一个问题:如果最终在两个终端节点之间给出的最短路径只有一条,则在该路径中的任一个节点或链路出现故障时,信号传输将面临中断的危险。因此,对网络路由选择作了以下改进:为任意两节点之间通信提供两条路径供其选择,即第一最短路径、第二最短路径.使用数据结构编程实现,程序=算法+数据结构的很好体现-In network communication, often request the shortest path. But totally shor
uses_allocator
- \file Functions to find shortest paths in a PDT.Specifies paren id, source and dest start states of a paren. These are the start states of the respective sub-graphs. -\file Functions to find shortest paths in a PDT.Specifies paren id, source and de
Yen_s_algorithm
- 利用YEN算法求前K条最短路径,有TEST的函数对测试网络进行求解,利用时更换输入网络即可。-YEN algorithm for the use of the former K shortest paths with TEST function to test network to solve, enter the network to replace the use of time.
Desktop
- 计算网络节点介数,节点的介数为网络中所有的最短路径中经过该点的数量比例。-Calculate the number of referrals referral network node number of nodes in the network all the shortest paths through the ratio of the number of points.
Dijkstra-Algorithm
- 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
dj.m
- This an example of the Dijkstra s algorithm which solve for the shortest paths between nodes in a graph. -This is an example of the Dijkstra s algorithm which solve for the shortest paths between nodes in a graph.
floyd
- 适用于APSP(All Pairs Shortest Paths,多源最短路径),是一种动态规划算法,稠密图效果最佳,边权可正可负。此算法简单有效-floyd All Pairs Shortest Paths
dijkstra_short-path-algo
- 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]
dijkstra
- Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph
pathanddistance
- 任意两点间最短路算法 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.)
485382
- Floyd-Warshall算法描述 1)适用范围: a)APSP(All Pairs Shortest Paths) b)稠密()