搜索资源列表
shortest-path
- 最短路径算法,对于权重图最短路径计算的基本算法-Shortest path algorithm, the basic algorithm for computing the shortest path weight of FIG.
Dijkstra
- 本算法用于查找最短路径,使用了数据结构中的dijkstra最短路径算法,并且在程序的最后输出了最短路径和经过的长度。- The algorithm for finding the shortest path, use the data structure dijkstra shortest path algorithm, and in the final output of the program and through the shortest path length.
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
dijkstra
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的,因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法,解决的是有向图中最短路径问题。-Dijkstra algorithm is a Dutch computer scientist Dijkstra proposed in 1959, so called Dijkstra algorithm. The rest is one vertex to each vertex of the shortest path alg
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
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的,因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法,解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。-Dijkstra algorithm was proposed by the Holland computer scientist Dijkstra in 1959, and therefore also called Dijkstra algorithm. Is
Dijkstra
- Dijkstra算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。-Dijkstra algorithm
Dijkstra
- 数据结构Dijkstra迪杰斯特拉带权有向图求最短路径算法,有图分析。-Data structure Dijkstra Dijkstra weighted directed graph algorithm for the shortest path between a figure analysis.
jiedian
- 在正方形区域内产生均匀分布的随机拓扑,红色信标节点 . 黑色未知节点,初始化节点间距离,跳数矩阵,最短路径算法计算节点间跳数,球每个信标节点的校正值,最小二乘法求未知点坐标-Generate uniformly distributed random topology in the square area, red beacon nodes. Black unknown nodes, the distance between node initialization, hop count matri
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
graph-theory-algorithm-MATLAB-code
- 图论算法及其MATLAB 程序代码,包含了常用的图论算法,如:最短路径算法。-Graph algorithms and MATLAB code, including commonly used graph theory algorithms, such as: shortest path algorithm.
Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for calculating a node to all other nodes in the shortest path. The main characteristic
djstra-backup
- 最短路径算法的C语言实现,迪杰斯特拉算法的C语言实现- Shortest path algorithm C language, Dijkstra algorithm C language
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
4
- 有关于图的最短路径算法,常用的Dijkstra和SPFA算法或可采用堆优化或可采用A*算法加速实现时间复杂度的大幅降低。但是本题中图的边长均为1,使用BFS的时间复杂度较Dijkstra和SPFA有更为明显的降低,尽管看上去BFS更为简单-Figure about the shortest path algorithm, commonly used Dijkstra algorithm and SPFA or heap can be used to optimize or A* algorith