Location:
Search - dijkstra
Search list
Description: Dijkstra算法经典实现,计算节点最短路径 -Dijkstra implementation
Platform: |
Size: 3072 |
Author: 张 |
Hits:
Description: dijkstra algorithm :a kind of algorithm which developed by java language
Platform: |
Size: 90112 |
Author: michael |
Hits:
Description: Dijkstra s algorithm!!! How you can find the shortest path in a graph
Platform: |
Size: 1024 |
Author: fanmoy |
Hits:
Description: 简单的实现Dijkstra算法求最短路径，能输几个节点及各个节点的距离，然后算出中心节点与其他节点的最短路径。-Simple implementation Dijkstra algorithm seek shortest path, can lose several node and various node distance then calculated center node with other node shortest path.
Platform: |
Size: 54272 |
Author: 朝 |
Hits:
Description: Dijkstra最短路径算法，用于求解网络中两节点的最短路径-Dijkstra
Platform: |
Size: 169984 |
Author: 徐博 |
Hits:
Description: Dijkstra算法（最短路径法）的matlab应用程序-Dijkstra algorithm (shortest path method) of matlab applications
Platform: |
Size: 1024 |
Author: ivo |
Hits:
Description: 最短路径搜索算法 dijkstra算法的改进-THE SHORTESR SEARCH PATCH
Platform: |
Size: 4096 |
Author: 李文锋 |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低-Dijkstra algorithm is a typical shortest path algorithm to calculate a node to all other nodes of the shortest path. Main features are a starting point for the center layers expand outward, until the expansion to end up. Dijkstra shortest path algorithm can be obtained the optimal solution, but because it traverses many computing nodes, so the low efficiency
Platform: |
Size: 16384 |
Author: 我下下 |
Hits:
Description: 使用Matlab编写的一个dijkstra算法，非常的实际好用-Written using Matlab a dijkstra algorithm, a very practical easy to use
Platform: |
Size: 1024 |
Author: Donghf |
Hits:
Description: implements dijkstra algorithm in c related to graph theory
Platform: |
Size: 1024 |
Author: sandeep |
Hits:
Description: dijkstra 单源最短路径不行算法 交流学习 -dijkstradijkstra 单源最短路径不行算法 交流学习
Platform: |
Size: 1285120 |
Author: 闫硕 |
Hits:
Description: java算法高级设计dijkstra代码Advanced Design dijkstra algorithm code java
-Advanced Design dijkstra algorithm code java
Platform: |
Size: 92160 |
Author: |
Hits:
Description: 实现了AE最短路径Dijkstra算法实现，希望能提供一些帮助-Dijkstra shortest path to achieve the AE algorithm, and the hope to provide some help
Platform: |
Size: 241664 |
Author: qxfeihappy |
Hits:
Description: java 实现dijkstra求最短路径的方法-dijkstra algorithm
Platform: |
Size: 87040 |
Author: weiwei |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解-Dijkstra algorithm is a typical shortest path algorithm, to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center outward layers of extended until the extension to the end up. Dijkstra shortest path algorithm to the optimal solution obtained
Platform: |
Size: 1024 |
Author: yuan |
Hits:
Description: 设在图G={V,E}中有一顶点r，Dijkstra算法可以求出其他所有点到点r的最短路径的跳数，这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path among those between v and r.
Platform: |
Size: 1024 |
Author: wx |
Hits:
Description: 并行化思路实现dijkstra算法。假设有p个处理器，N个顶点。给每个处理器分配N/p个顶点，求出局部的最小值，复杂度为O (N/p)。然后后一半的处理器将自己的最小值发送给第前p/2个处理器。前一半处理器接收到传来的值后，与局部的最小值比较，作为新值。继续循环，直到剩下一个处理器为止。-Parallelized dijkstra algorithm. Suppose there is p a processor, N vertex. Give each processor distribution N/p a vertex, find out the local minimum value, complexity is O (N/p). And then later half of the processors will sent its own minimum value to the first former p/2 processors. the first half receive the value of the processor and compare with the local minimum value,as a new value. Continue the circulation, until only one processor is left.
Platform: |
Size: 744448 |
Author: joyce |
Hits:
Description: 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 starting point for the center layers expand outward until the end date extended to
Platform: |
Size: 1024 |
Author: 王勇 |
Hits:
Description: 图与网络论中求最短路径的Dijkstra算法 M-函数
格式 [S,D]=minroute(i,m,W)
i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵，
不构成边的两顶点之间的权用inf表示。显示结果为：S的每
一列从上到下记录了从始点到终点的最短路径所经顶点的序号；
D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-function the format [S, D] = minroute (i, m, W) i is the starting point of the shortest path, m is the graph vertices, W is the graph with adjacency matrix power, does not constitute the edge between two vertices of the right to use the inf that. Showing results: S a top to bottom of each record from the beginning to the end point of the shortest path through the vertices of the serial number D is a row vector to record the path shown in the size of S
Platform: |
Size: 1024 |
Author: 童康 |
Hits:
Description: Java语言编写的迪杰斯特拉算法，通过演示以及代码的分析可以帮助大家掌握此算法。-Java language Dijkstra algorithm, demos, and code analysis can help us grasp the algorithm.
Platform: |
Size: 94208 |
Author: blue_fox |
Hits:
«
1
2
3
4
56
7
8
9
10
...
50
»