搜索资源列表
Dijkstra_matlab
- matlab 实现单源点最短路径算法。包含注释和运行结果。-matlab Dijkstra
find_shortest_path
- 通过Dijkstra算法实现对于给定带权重地图,输入起点和终点找寻最短路径,并输出路径.-By Dijkstra algorithm given a weighted map, enter the start and end to find the shortest path, and output path.
Floyd-CSharp
- 弗洛伊德(Floyd)算法 主要是用于计算图中所有顶点对之间的最短距离长度的算法,如果是要求某一个特定点到图中所有顶点之间的最短距离可以用Dijkstra(迪杰斯特拉)算法来求。 弗洛伊德(Floyd)算法的算法过程是: 1、从任意一条单边路径开始。所有两点之间的距离是边的权,如果两点之间没有边相连,则权为无穷大。 2、对于每一对顶点 u 和 v,看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比已知的路径更短。如果是更新它。 把图用邻接矩阵G表示出来
c
- 迪杰斯特拉算法主要是采用了一个dist一维数组,来存储源点到其它顶点的最短路径,然后不断更新。-Dijkstra algorithm is used mainly in a dist one-dimensional array to store the point vertices of the shortest path to other sources, and constantly updated.
dijkstra3.c
- dijkstra algorithm 用来描述最短路径,这里是并行化的实线.希望大家有时间试试,用的是openmp-dijkstra algorithm is used to describe the shortest path, here it is the parallelism of the solid line. I hope you have time to try, using a openmp
DJSITEPATH
- 根据迪杰斯特拉计算经景点最短路径 并显示路径-According to Dijkstra shortest path calculated by the attractions and shows the path
D
- 最短路径分析,Dijkstra经典路径算法,有向加权图-Dijkstra
ShortestPath
- 迪杰斯特拉算法求解最小路径,只用给出节点信息以及邻接矩阵即可求出节点对间最短路径,最短路径存于元胞内。文件中有测试的数据,可以替换。-Dijkstra algorithm minimum path, and the only information given node adjacency matrix you can find the shortest path between nodes, the shortest path within the cellular memory. File
T_Dijstra
- matlab实现图上需找最短路径的迪杰斯特拉算法,寻找任一点和其他点之间的最短距离,最终结果为最短路径度量矩阵和正序路由矩阵-matlab implementation on the map to find the shortest path Dijkstra algorithm to find the shortest distance between any point and other points, the final result is the shortest path metri
Cpp1
- 用邻接表表示图,重写Dijkstra算法,输入任意带权有向图,输出其每一对顶点之间的最短路径-A diagram showing the adjacency table, rewriting Dijkstra algorithm, with the right to enter any directed graph, the output of each of its shortest path between the vertices
shortest
- 利用Dijkstra算法计算任意两点间的最短路径 -the progress of calculate the shortest path
matlab_bgl
- 图论基本函数库,函数相当丰富.包含 图论工具箱、基本图论函数库、Dijkstra最短路径、Kruskal最小生成树-The MATLABBGL library fills a hole in Matlab s suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs, as in graph theory graphs. The MatlabBGL package uses Ma
4.2
- 基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法,路径必须经过要求的必经点,且不成环。 该算法采用了一种自适应调整的方法,经过多次迭代,使解收敛。 但只是寻找了一个略优的可行解(每次迭代都基于贪婪算法寻找),不能保证最优解。而且如果图过于稀疏,因为收敛速度过快,可能导致问题无解(收敛于一个局部最优解,没有经过所有点)。 解决相对稠密的图(每个点的平均出入度4以上),表现良好。 备注:里面有一个QT的工程,可以直接打开(源码里没用QT的库)-Weigh
shortpath
- 读取点线连接,使用类迪杰斯特拉算法求解最短路径输出服务区范围,并通过nodejs搭建服务器,在网页上用canvas绘制显示。原始数据中,点数据为(ID,坐标xy)线数据为(前后连接点,权值)-Read point line connection using class Dijkstra shortest path algorithm output service area, and set up the server through nodejs, drawn with canvas on th
submit
- 对有约束问题的最短路径算法,有必经节点,基于DFS和迪杰斯特拉算法-Problem of constrained shortest path algorithm, must pass through a node-based DFS and Dijkstra Algorithm
Map
- 一个简单的地图导航系统,根据迪杰斯特拉最短距离算法求得选定两点之间的最短路径,然后根据要求打印或者输出。-A simple map navigation system, according to dijkstra shortest distance algorithm selected the shortest path between two points are obtained, and then print or output according to the requirements.
DijkstraPath
- Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。-Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path.
ConsoleApplication4
- 用Dijkstra算法求有向图G的v1顶点到其他顶点v的最短路径Path[v]及其距离Dist[v],以学校地点为例-With Dijkstra algorithm for a directed graph G vertices v1 shortest path to other vertex v Path [v] and its distance Dist [v], school locations Case
Subway
- 名称:地铁票价查询系统; 主要算法:迪杰斯特拉算法; 实现功能:计算最短路径,并求出相应的票价。-Name: Subway fare search system The main algorithm: Dijkstra algorithm Function: calculate the shortest route, and find the appropriate fare.
djstra-backup
- 最短路径算法的C语言实现,迪杰斯特拉算法的C语言实现- Shortest path algorithm C language, Dijkstra algorithm C language