搜索资源列表
zuiduanlujing
- 优化了之前的那个版本，最短路径用Dijkstra算法实现的MFC编程，这次是按实际的路径来将路画出来了。-That before the optimized version of Dijkstra shortest path algorithm using the MFC programming, this is the actual path to the road drawn out.
Dijkstra
- Dijkstra java实现的最短路由算法，内含java源代码-Dijkstra java routing algorithm to achieve the shortest, containing java source code
number
- /*用Dijkstra算法求有向网C的v1定点到其余顶点v的带权路长D[v] final[v]为ture当且仅当v在S的集合内，就求得从v1到v的最短路径*/
Dijkstra
- 迪杰斯特拉最短路径算法，有兴趣的可以在此基础上进一步优化-Optimized Dijkstra shortest path algorithm
wsn-dijkstra
- 这个程序为能量均衡的无线传感器的最短路径路由算法matlab 编程。-This process is energy balanced shortest path routing in wireless sensor algorithm matlab programming.
Dijkstra
- Dijkstra算法设计单源最短路径问题的贪心算法-Greedy algorithm of Dijkstra algorithm design single source shortest path problem
otmdijkstra
- Dijkstra算法-Dijkstra algorithm
linjiebiao
- 用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序-adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures
SHORTPATHmatlab
- Dijkstra算法与Floyd算法的matlab实现，以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem
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
tree
- 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解，能够熟练使用map容器，复习集合和字典的相关知识。理解最短路径问题，并使用Dijkstra算法解决最短路径问题。掌握线形表的使用，并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。 -Application of simulation using the tree railway inquiry function. Master graph adjacency list of def
code
- 一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with th
DijkstraTest
- Dijkstra算法及demo实现，目前10万点,20条边，平均搜索时间为3.7秒.-Dijkstra algorithm and the realization demo now 100,000 points, 20 edges, the average search time of 3.7 seconds.
Dijkstra
- Dijkstra最短路径算法 Dijkstra最短路径算法-Dijkstra shortest path algorithm Dijkstra shortest path algorithm
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
Dijkstra
- 使用DIJKSTAR算法解决多点最短路径,还带文字解说-Dijkstar algorithm used to solve multi-point shortest path, but also with text to explain
Dijkstra
- Dijkstra for the shortest path algorithm
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
1
- Dijkstra路由算法，简单明了-Dijkstra routing algorithm, simple
migongsuanfa
- 将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历 的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点 到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algo