Location:
Search - Dijkstra
Search list
Description: Dijkstra 算法 c++
Platform: |
Size: 903120 |
Author: hzwsf502@126.com |
Hits:
Description: Dijkstra algorithm implementrd with C++.
Platform: |
Size: 1754 |
Author: besoyal@yahoo.gr |
Hits:
Description: Dijkstra router算法
Platform: |
Size: 3993 |
Author: 376546269@qq.com |
Hits:
Description: Dijkstra算法-Dijkstra algorithm
Platform: |
Size: 1024 |
Author: arthur |
Hits:
Description: 最短路径算法，采用Dijkstra算法实现两点之间的最短路径算法。-shortest path algorithm Dijkstra algorithm used between two points is the shortest path algorithm.
Platform: |
Size: 48128 |
Author: 自由鸟 |
Hits:
Description: Dijkstra算法在JAVA中的实现方法-Dijkstra algorithm in the Java Implementation
Platform: |
Size: 3072 |
Author: 张强 |
Hits:
Description: dijkstra算法-- Algorithm
Platform: |
Size: 1024 |
Author: 李雷 |
Hits:
Description: 利用dijkstra算法编写的公交线路的最小换乘问题的算法-Dijkstra algorithm to use the bus lines to prepare the smallest change Algorithm
Platform: |
Size: 1024 |
Author: 刘文旭 |
Hits:
Description: 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
Platform: |
Size: 1024 |
Author: 刘兰英 |
Hits:
Description: 实现了Dijkstra算法，解决最短路径问题。-achieve the Dijkstra algorithm, the shortest path to solve the problem.
Platform: |
Size: 57344 |
Author: 李小平 |
Hits:
Description: 数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法-algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.
Platform: |
Size: 9216 |
Author: 美美 |
Hits:
Description: 利用VB开发的一个最短路径查询系统，算法是DijKstra，可以用在其他开发的软件中特别是GIS系统。-use VB shortest path of a query system, the algorithm is DijKstra, can be used in the development of other software, particularly GIS system.
Platform: |
Size: 13312 |
Author: 反对撒 |
Hits:
Description: 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
Platform: |
Size: 8192 |
Author: aaa |
Hits:
Description: 一．算法介绍:
**数据结构:
1.可利用资源向量Available
2.最大需求矩阵Max
3.分配矩阵Allocation
4.需求矩阵Need
**功能介绍:
模拟实现Dijkstra的银行家算法以避免死锁的出现.分两部分组成:
第一部分:银行家算法(扫描)
1．如果Request<=Need,则转向2 否则,出错
2．如果Request<=Available,则转向3,否则等待
3．系统试探分配请求的资源给进程
4．系统执行安全性算法
第二部分:安全性算法
1.设置两个向量
(1).工作向量:Work=Available(表示系统可提供给进程继续运行所需要的各类资源数目)
(2).Finish:表示系统是否有足够资源分配给进程(True:有 False:没有).初始化为False
2.若Finish[i]=False&&Need<=Work,则执行3 否则执行4(I为资源类别)
3.进程P获得第i类资源,则顺利执行直至完成!并释放资源:
Work=Work+Allocation
Finish[i]=true
转2
4. 若所有进程的Finish[i]=true,则表示系统安全 否则,不安全!-one. Algorithm introduced :** Data Structure : 1. The resources available vector Available 2. The biggest demand matrix Max 3. Allocation distribution matrix 4. Need** demand matrix function presentations : Simulation of bankers Dijkstra algorithm to avoid the emergence of deadlock. Composed of two parts : Part I : bankers algorithm (scanning) 1. If Requestlt; = Need, has turned two Otherwise, the two errors. If Requestlt; = Available, has turned three, or wait for the three. System testing requested resource allocation process to four. Safety system for the implementation of the second part of algorithm : a security algorithm. Set up two vector (1). Vector work : Work = Available (expressed system available to the continued operation of the process required number of resources of all ki
Platform: |
Size: 7168 |
Author: 李琪 |
Hits:
Description: 北京交通大学校园旅游导航系统，利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
Platform: |
Size: 315392 |
Author: 陈勋 |
Hits:
Description: 实现路由算法，利用Dijkstra算法实现两台PC机之间的路由行走路径。-achieve routing algorithm, using Dijkstra algorithm between two PCs running the routing path.
Platform: |
Size: 601088 |
Author: 陈勋 |
Hits:
Description: 实现了图的数据结构和Dijkstra算法。例子为中关村附近的交通问题。-achieved map data structure and Dijkstra algorithm. For example Zhongguancun near the traffic problems.
Platform: |
Size: 252928 |
Author: 刘源 |
Hits:
Description: Dijkstra最短路径算法，稍作修改亦可作为最短路由算法-Dijkstra shortest path algorithm, can be slightly amended as the shortest routing algorithm
Platform: |
Size: 3072 |
Author: 任务 |
Hits:
Description: 最短路径算法的VB实现，最短路径的查询程序-shortest path algorithm VB, shortest path inquiry procedures
Platform: |
Size: 4096 |
Author: Andy |
Hits:
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
50
»