搜索资源列表
课程设计
- 数据结构课程设计程序。包括6种排序算法以及最短路径的源程序。值得一下。
dijkstra
- Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。 -Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. Main feature
shortest
- Dijkstra算法通过邻接表实现最短路径,-Dijkstra algorithm to achieve the shortest path adjacency list,
Graph_Algorithm-1.0.tar
- 算法中图算法的详细实现,包括图的表示,MST,单源最短,所有最短路径算法的c++实现,在linux环境下面编程。-Algorithm in detail algorithm to achieve, including the map that, MST, single-source shortest, all the shortest path algorithm c realization of the following programming in linux environmen
Skyline-based_Shortest_Path_Analysis_Algorithm_Des
- 基于Skyline的最短路径分析算法设计与实现-Skyline-based_Shortest_Path_Analysis_Algorithm_Design_and_Implementation_of
shortest_path
- 基于dijkstra算法实现求节点到其他节点的最短路径-Dijkstra algorithm based on the node to other nodes seeking the shortest path
Dijkstra
- 最短路径问题,迪杰斯特拉算法,图像,读取数据,linux-The shortest path problem, Dijkstra algorithm
suanfashejiyufenxi
- 算法分析与设计的实验代码,有N后问题,单元最短路径,布线等问题-Code of algorithm analysis and design of experiments, N after the problem, the unit shortest path, wiring and other issues
danyuan
- 算法分析,单源最短路径,贪心算法实现的,非常好用-Algorithm analysis, single source shortest path, the greedy algorithm is very easy to use
Dijkstra
- 实现单元最短路径(贪心算法)的程序设计 ,算法分析与设计-Unit shortest path (greedy algorithm) program design, algorithm analysis and design
minPath
- 这是一道算法作业题目,解决一个分支定界问题,求最短路径问题-This is an algorithm assignment questions to resolve a branch and bound for the shortest path problem
spfa
- 一种求最短路径的算法,适合有向图和无向图,望大家批评指正-A shortest path algorithm, suited to map and no map, we hope to criticism and
the-shortest-road(3)
- 另外一种求最短路径的方法,算法的实用性较强-In addition, a method for the shortest path algorithm practical
the-shortest-road(4)
- 求最短路径的各种算法,通过对比得出各算法的优劣性-Shortest path algorithm, derived by comparing the pros and cons of each algorithm
the-shortest-road(1)
- 不同的求最短路径的方法,每个算法都有各自的优点,根据具体情况选用不同的算法-Different method for the shortest path, each algorithm has its own advantages, depending on the circumstances the choice of different algorithms
findpt
- VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 -The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is
Dijstra
- 迪杰斯克拉算法,可以读取点数与路径,并求出指定两点间最短路径-dijstra play it is really a good thing
test1
- Prim算法的C语言实现,构造连通图,寻找N个点的最短路径。-Prim algorithm C language implementation of connected graph structure, looking for N point of the shortest path.
dtw
- 这个算法是基于动态规划(DP)的思想,解决了发音长短不一的模板匹配问题,简单来说,就是通过构建一个邻接矩阵,寻找最短路径和。-This algorithm is based on the idea of dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, in simple terms, is by building a
mpi
- 高性能计算与云计算 实验报告 ——MPI 求最短路径 本实验的目的是通过练习掌握分布存储并行编程的知识和技巧。 1. 了解并行算法的设计方法 2. 掌握MPI并行程序编写的基本步骤 3. 掌握MPI编程环境和工具的使用 4. 了解MPI程序调试和调优的技巧 -High-performance computing and cloud computing lab report MPI seeking purpose of this experiment is th