搜索资源列表
北京交通大学校园旅游导航系统
- 北京交通大学校园旅游导航系统，利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
实现路由算法
- 实现路由算法，利用Dijkstra算法实现两台PC机之间的路由行走路径。-achieve routing algorithm, using Dijkstra algorithm between two PCs running the routing path.
MySeg
- 最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstra algorithm derived from the s
Dsuanfa
- Dijkstra算法-Dijkstra algorithm
Dijkstra_Huffman_Prim
- prim算法Huffman算法Dijkstra算法和实验报告-prim algorithm Huffman algorithm Dijkstra algorithm and experimental report
Dijkstra
- 根据大连理工的《数据结构》课本自己写的Dijkstra算法,从文件读取顶点之间的路径数据,然后输出结果
dijkstra
- 一个很好的dijkstra算法程序。强烈推荐大家下载！
parallel-dijkstra 并行化思路实现dijkstra算法
- 并行化思路实现dijkstra算法。假设有p个处理器，N个顶点。给每个处理器分配N/p个顶点，求出局部的最小值，复杂度为O (N/p)。然后后一半的处理器将自己的最小值发送给第前p/2个处理器。前一半处理器接收到传来的值后，与局部的最小值比较，作为新值。继续循环，直到剩下一个处理器为止。-Parallelized dijkstra algorithm. Suppose there is p a processor, N vertex. Give each processor distributi
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. Main features is the starting
dijkstra
- D算法MATLAB实现,Dijkatra为主要算法，main函数举例实现-use matlab to make out D
dijkstra_suanfa
- dijkstra 这是用C语言实现的贪心算法 看这个程序前最好先看看图形说明-Dijkstra this is achieved using C language greedy algorithm to see this process take a look at the graphics before the best descr iption
Graph
- 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorith
dijkstra
- algorithm Dijkstra source code in c-algorithm Dijkstra source code in c++
Dijkstra
- Dijkstra算法的C++编程实现，对简单的数据组合进行计算-Dijkstra algorithm c++ programming implementation, combination of simple data to calculate
Dijkstra
- 最短路Dijkstra算法-Dijkstra shortest path algorithm
Dijkstra
- 应用Dijkstra算法对铁路网络两站点间最短径搜索，附有我国铁路网络数据。-Application of Dijkstra algorithm rail network between the two sites on the shortest route search, with China s railway network data.
dijkstra-algorithm
- 在多条可供选择的路径中，利用Dijkstra算法选出一条最优路径。-In the multiple paths available, using the Dijkstra algorithm to the optimal path.
dijkstra
- Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph
dijkstra CUDA
- dijkstra code cuda windows
Dijkstra迪捷斯特拉算法
- 迪杰斯特拉算法是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。(The Dijkstra algorithm is the shortest path algorithm from one vertex to the other vertices, and the shortest path problem in the directed graph is solved. The main featur