搜索资源列表
Dijkstra_matlab
- matlab 实现单源点最短路径算法。包含注释和运行结果。-matlab Dijkstra
shujujiegousuanfa
- 各种最小生成树算法 最短路径算法 邻接矩阵和邻接表的相互转化 求连通分量的算法-Interconversion of various minimum spanning tree algorithm shortest path algorithm adjacency matrix and adjacency list of requirements connected component algorithm
Dijkstra-algorithm
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的,因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法,解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。-Dijkstra algorithm is a Dutch computer scientist Dijkstra proposed in 1959, the so called Dijkstra algorithm. From one vertex to each
lab4
- 最短路径算法 可以设置路径的权值 可以打印每条路径的权值-shortest path algorithm
zuiduanlujing
- 最短路径算法程序,matlab程序,傻瓜式套用-The shortest path algorithm program, matlab, fool to paraphrase
dijkstra
- 最短路径算法适用于求交通网络中各节点的最短路径-shortest path algorithm
Dijkstra_Source_Code
- 有向图最短路径算法 有向图最短路径算法-Directed graph shortest path algorithm
shortest-path
- 最短路径算法,对于权重图最短路径计算的基本算法-Shortest path algorithm, the basic algorithm for computing the shortest path weight of FIG.
4.2
- 基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法,路径必须经过要求的必经点,且不成环。 该算法采用了一种自适应调整的方法,经过多次迭代,使解收敛。 但只是寻找了一个略优的可行解(每次迭代都基于贪婪算法寻找),不能保证最优解。而且如果图过于稀疏,因为收敛速度过快,可能导致问题无解(收敛于一个局部最优解,没有经过所有点)。 解决相对稠密的图(每个点的平均出入度4以上),表现良好。 备注:里面有一个QT的工程,可以直接打开(源码里没用QT的库)-Weigh
Dijstra
- 最短路径算法,采用回溯方法,有案例,可以运行,有图形生成,方便理解-Shortest path algorithm, the use of backtracking, there are cases, you can run, there are graphics generation
submit
- 对有约束问题的最短路径算法,有必经节点,基于DFS和迪杰斯特拉算法-Problem of constrained shortest path algorithm, must pass through a node-based DFS and Dijkstra Algorithm
HuffmanTree-Shortest-Path
- 赫夫曼树的建造过程,以及最短路径算法,有关键步奏的注释,需输入节点数据以及邻接矩阵的内容,注意看主函数-Huffman tree construction process, as well as the shortest path algorithm, the key step-outs comments, data and content needs input node adjacency matrix, note the main function
Dijkstra
- Dijkstra算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。-Dijkstra algorithm
Dijkstra
- 数据结构Dijkstra迪杰斯特拉带权有向图求最短路径算法,有图分析。-Data structure Dijkstra Dijkstra weighted directed graph algorithm for the shortest path between a figure analysis.
WWZCM
- 编写的最短路径算法,娃娃找草莓,我改写了一下-Shortest path algorithm written doll find strawberries, complete demonstration program, study the game the shortest path or the data structures are useful.
Floyd
- Floyd算法的C++实现,求任意两点间最短路径 算法复杂度 O(n^3)-Floyd algorithm
dijk
- Dijkstra算法,开放分类为单源最短路径算法,内含编程思路。-Dijkstra s algorithm, open classified as single-source shortest path algorithm, embedded programming ideas.
Astar-Archive-algorithm
- Astar 最短路径算法Archive Copyright (c) 2010, Bob Sturm All rights reserved.-Astar shortest path algorithm Archive Copyright (c) 2010, Bob Sturm All rights reserved.
dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止-Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm for computing a node to all other nodes of the shortest path. The main feature is the sta
minimum_path
- 最短路径算法,根据输入的节点矩阵和起点终点,计算最短路径的长度和最短路径-The shortest path algorithm, based on the input node matrix and the starting point of the finish line, calculation of the length of the shortest path and the shortest path