搜索资源列表
shortest_distance
- Dijkstra算法求最短路，用堆优化，经测试，该算法性能比未优化的Dijkstra算法快-dijkstra with pairing heap optimized algorithm for shortest path problem
Bellman-ford
- 单源最短路径Bellman-ford。该算法可以用来解决一般（边的权值为负）的单源最短路径问题，而dijkstra只能解决权值非负的情况。此算法使用松弛技术，对每一个顶点，逐步减少源到该顶点的路径的估计值，直到达到最短的路径。-Single source shortest path Bellman-ford. The algorithm can be used to solve the general (the right side is negative) single-source shor
Graph
- 图论的各种最短路算法,竞赛用 包括dijkstra、Bellman-Ford（SPFA）、Floyd-Warshall、优先队列的应用等-A variety of graph theory shortest path algorithm, racing including dijkstra, Bellman-Ford (SPFA), Floyd-Warshall, the application of the priority queue
Project_ShortestPath
- 任务：实现Dijkstra算法 工程名：Project_ShortestPath 要求：实现Dijkstra算法，算法主体写在CGraph类中；要求是从command窗口中输入源节点编号，并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注：要输出整条路径，而不仅仅是前一跳，也不允许逆序输出。 -Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requ
zuiduan
- 设图的顶点大于1个，不超过30个，每个顶点用一个编号表示（如果一个图有n个顶点，则它们的编号分别为0, 1, 2, 3, …, n-1）。 此题为求有向网中顶点间最短路径问题，可建立以票价为权的邻接矩阵，用Dijkstra算法求最短路径长度。 Dijkstra算法中有一个辅助向量D，表示当前所找到的从源点到其它点的最短路径长度。因为每次都要在D中找最小值，为提高性能，用最小值堆的优先队列存储D值。 -Let the vertex is greater than 1, no more
dijk1
- Dijkstra算法,关于 Dijkstra算法解决voronoi图的问题,用 Dijkstra算法解决voronoi图中求解最短路径的时候,有一个"dijkstra.m"的文件-Dijkstra algorithm voronoi diagram on Dijkstra algorithm to solve the problem, using Dijkstra algorithm to solve voronoi diagram for solving the shortest path,
DijkstraFloyd
- Dijkstra&Floyd的matlab 算法实现，计算出最短的路径，简单实用-Dijkstra & Floyd' s algorithm matlab to calculate the shortest path, simple and practical
castle
- 按照dijkstra拓展，顺便记录有多少个最短的， 每次把当前扩展到的点有多少种可以扩展的方法数乘上去就可以了。 -In accordance with the dijkstra expand, by the way how many records the shortest, Extended to every point of the current number of species multiplied by the number of methods can be exte
Dijkstra_matlab
- Dijkstra算法求任意两点间最短路径，有完整的matlab程序-Dijkstra algorithm to find the shortest path between any two points, a complete matlab program
dijkstra_CPP
- 图论中的最短距离算法dijkstra，基于C++实现，对于数学建模有很大帮助。-The shortest distance between graph theory algorithms dijkstra, based on C++ implementation, for mathematical modeling of great help.
DIJandFloyd
- 输入一个邻接矩阵，求一个图的最短路径，2种方法：迪杰斯特拉发和弗洛伊德法-Enter an adjacency matrix, the shortest path of a graph, two kinds of methods: Dijkstra hair and Freud Act
ShanghaiSubway
- 本系统是在flash环境下，以ACTION scr ipt3.0为开发语言的一套上海地铁查询系统。功能如下：显示每个站点的首末班车信息，高亮显示选中的线路，中英文切换，快速查询站点位置，以dijkstra算法计算两站点间的最短路径等。相关数据记录在XML文件中。-The system is in a flash environment to ACTION scr ipt3.0 for the development of a Shanghai subway language query syst
dijkstranewstring
- 数据结构的图知识，寻找最短路径，采用迪杰斯特拉Dijkstra方法-FIG knowledge of data structures, find the shortest path using Dijkstra Dijkstra method
danyuanzuiduanlujing
- 自己写的关于单元最短路径的算法实现，也就是迪杰斯特拉算法的实现！-Himself wrote on the unit shortest path algorithm, Dijkstra algorithm is realized!
GraphProblem
- 图的最短路径问题，用迪杰斯特拉算法计算两个城市之间的最省时路线或最省钱路线。-It s about the shortest way of a graph.We use dijkstra to find the best way which cost least time or money.
folysuanf2
- 运用 Floyd 算法解决了 Dijkstra 算法无法解决的弧权为任意实数的网络最短路问题，并且给出了Floyd 算法的最短路长与最短路径的 MATLAB 程序，此程序具有通用性。-Floyd algorithm using Dijkstra s algorithm to solve the arc right can not be solved for any real number of network shortest path problem, and gives Floyd algo
Mindis
- 利用dijkstra算法求解图中两点最短路径的问题，完美运行-Use dijkstra algorithm based shortest path problem in two perfect runs
MINROUTE
- 用于解决最短路径问题的算法被称做“最短路径算法”， 有时被简称作“路径算法”。 最常用的路径算法有： Dijkstra算法-The shortest path algorithm is used to solve the problem is called the " shortest path algorithm," sometimes referred to as a " path algorithm." The most common path al
Dijsktra_final
- 基于Dijkstra方法的最短路径改良版方法,能够一次性搜索出最优最优起点终点、最优路径、路径长度，常用于图论相关问题-Shortest path method ,which is based on a modified version of the method Dijkstra, is possible to search out the best starting point, terminate point, the optimal path, and the path length.I
exp_2
- 从文件读入一个有向正权图(n 个结点,m 条边)的权矩阵表示,输出这个图中某一结点到 其余各结点的最短路径长度。 程序必须使用 Dijkstra 算法,使用其他算法(比如穷举)不符合要求。-Reading from a file into a right to a positive figure (n nodes, m edges) of the weight matrix, said output this figure a junction to the length of the sh