搜索资源列表
CS编的Dijkstra算法(图形界面)
- Windows应用程序,C#编写,实现了求最短路径的Dijkstra算法,方便操作,可以自已在程序界面上指定每一个点的位置,在界面上空白的地方每点击一下生成一个点(该点是一个可以点击的按钮),这些按钮按照出现的先后顺序自动从1开始编号(目前程序设定最多支持100个点,可自行更改)。界面右上角是计算结果显示区,往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区,状态区显示当前的起点和终点,连线和计算都要用到该信息(点击生成的顺序编号的那些按钮可以依次改变起点和终点)。输入权值后点“连线
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.
wsn-dijkstra
- 这个程序为能量均衡的无线传感器的最短路径路由算法matlab 编程。-This process is energy balanced shortest path routing in wireless sensor algorithm matlab programming.
Dijkstra
- 最短路径Dijkstra算法,是用C#编的,很经典的算法-Dijkstra shortest path algorithm is the use of C
tree
- 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解,能够熟练使用map容器,复习集合和字典的相关知识。理解最短路径问题,并使用Dijkstra算法解决最短路径问题。掌握线形表的使用,并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。 -Application of simulation using the tree railway inquiry function. Master graph adjacency list of def
Dijkstra
- 使用DIJKSTAR算法解决多点最短路径,还带文字解说-Dijkstar algorithm used to solve multi-point shortest path, but also with text to explain
Dijkstra
- Dijkstra最短路径 void output_path(int v)-Dijkstra shortest path void output_path (int v)
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
Dijkstra
- 用Dijkstra算法实现最短路径,在VC++6.0中运行-Using Dijkstra shortest path algorithm in VC++6.0 run
Dijkstra-omp
- C语言和OpenMP编写的可在多核或SMP处理器上进行多线程运行的最短路径算法。可了解多核多线程和OpenMP的并行编程技术。-C language and can be prepared OpenMP or multi-core processors on SMP multi-threading to run the shortest path algorithm. Learn to multi-core multi-thread and OpenMP parallel programming
Dijkstra
- 该问题为单元最短路经问题,求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边,有向图的信息由一个邻接表来表示,另外对每个顶点都设置一个属性d[v],描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S,反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中,算法中还用到了顶点的最小优先队列,排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed
dijkstra
- 计算最短路径,根据单源最短路径算法中的Dijkstra‘s算法-computer Dijkstra s shortest path
Dijkstra
- 迪杰斯科拉算法:从某个源点到其余各顶点的最短路径-DiGisi Kola algorithm: from a source point to the remaining vertex of the shortest path
DIJKSTRA
- 最短路径问题是重要的最优化问题之一,在现实生活中具有重要意义,比如:管道铺设、线路安排。-The shortest path problem is an important one of the most optimization problems, in real life is of great significance, such as: pipeline, line arrangement.
Dijkstra
- 最短路径算法 很不错的哦 适合初学着学习-the shortest
matlabCode
- floyd最短路算法、dijkstra最短路算法、求网络的最小费用最大流-floyd shortest path algorithm, dijkstra shortest path algorithm, find the minimum cost maximum flow networks
Assignment2
- 从外部读取文件 运用dijkstra算法 计算最短路径 通过最短路径 寻找最佳方案 UTAS KXC251 Assignment2-Read the file from an external application of dijkstra shortest path algorithm to find the shortest path through the best solution UTAS KXC251 Assignment2
Dijkstra
- Dijkstra最短路算法通用Matlab程序,可供参考-Dijkstra shortest path algorithm for generic Matlab program, available for reference
DijkstraCPP
- Dijkstra shortest path CPP version for VC-Dijkstra shortest path CPP version for VC++
Dijkstra
- 实现了AE最短路径Dijkstra算法实现,希望能提供一些帮助-Dijkstra shortest path to achieve the AE algorithm, and the hope to provide some help