搜索资源列表
parallel-dijkstra
- 并行化思路实现dijkstra算法。假设有p个处理器，N个顶点。给每个处理器分配N/p个顶点，求出局部的最小值，复杂度为O (N/p)。然后后一半的处理器将自己的最小值发送给第前p/2个处理器。前一半处理器接收到传来的值后，与局部的最小值比较，作为新值。继续循环，直到剩下一个处理器为止。-Parallelized dijkstra algorithm. Suppose there is p a processor, N vertex.
Dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the st
Dijkstra
- 图与网络论中求最短路径的Dijkstra算法 M-函数 格式 [S,D]=minroute(i,m,W) i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵， 不构成边的两顶点之间的权用inf表示。显示结果为：S的每 一列从上到下记录了从始点到终点的最短路径所经顶点的序号； D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s sho
dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path.
616191算法作业
- 1.二分搜索技术2.最接近点对问题3.矩阵连乘问题4.电路布线5.单源最短路径Dijkstra算法6.最小生成树Prim算法7.最小生成树Kruskal算法C语言写的，全部能运行！(algorithm design assignment)
suanfa
- dijkstra算法，用来解决图与网络数学模型的问题。(Dijkstra algorithm is used to solve the problem of graph and network mathematical model.)
Dijkstra算法
- 迪杰斯特拉算法求最短路径距离，可用于流形测地距离计算中。(Dijkstra algorithm for the shortest path distance, can be used for manifold geodesic distance calculation.)
dijk
- Dijkstra算法解决voronoi图的问题(The Dijkstra algorithm solves the problem of voronoi diagram)
dijkstra
- Dijkstra算法求任意两点间最短路径(Dijkstra algorithm to find the shortest path between any two points)
dijkstra
- 计算某点到各点的最短距离，利用Dijkstra算法实现(The shortest distance from point to poin)
最短路径（Dijkstra算法）
- 已知两点，求该两地那间的最短路径，注意与TSP有区别。(When two points are known, the shortest path between the two places is considered, noting that there is a difference between TSP and the other.)
Dijkstra
- Dijkstra算法，利用matlab实现(Dijkstra, implemented by matlab)
Dijkstra
- dijkstra 单源最短路径算法，用于计算一个节点到其他所有节点的最短路径(A single source shortest path algorithm is used to compute the shortest path from one node to all other nodes)
Dijkstra graphshortestpath floyd
- 移动机器人的最优路径规划 Dijkstra 算法程序代码 路径规划程序(path planning Optimal path planning of mobile robot Dijkstra algorithm code path planning program)
huawei_Compete
- 本例基于华为勇敢星挑战赛的测试用例，通过Dijkstra算法实现数据通信的优化工作。(This example is based on HUAWEI brave star challenge test case, through the Dijkstra algorithm to achieve data communication optimization work.)
chapter23
- matlab智能算法 之 基于Dijkstra算法的路径规划算法(Path planning algorithm based on Dijkstra algorithm for matlab intelligent algorithm)
dijkstra
- 求有向图中的一点到任意一点之间的最短路径，用dijkstra算法实现。(The shortest path between one point and any point in the directed graph is realized by the Dijkstra algorithm.)
dijkstra
- 求短路算法m程序，输入节点数量，两点间的实际距离，运行即可得到最短的路线，属于matlab程序。(Short circuit algorithm m program, matlab program)
dijkstra
- 一个对dijkstra算法功能的加强，可以直接输出任意两点的最短距离矩阵(A strengthening of the function of the Dijkstra algorithm, which can directly output the shortest distance matrix of any two points)
C++ Dijkstra
- C++实现Dijkstra算法完整代码，Dijkstra算法的实现，代码简单(C++ realizes the complete code of the Dijkstra algorithm, the implementation of the Dijkstra algorithm, the code is simple)