搜索资源列表
zxcvnjhjhkjk
- 最短路径----迪杰斯特拉算法这是用数据酷编写的超级还曾需飞行行分区地方人个还有就适合打击的假死优化哦----- Dijkstra shortest path algorithm which is used to prepare data super cool flight line had to be a district where there are suitable for people against the suspende
dsdv
- ns2下dsdv实现代码。DSDV（Destination-Sequenced Distance-Vector）协议是先应式路由协议，是由传统的Bellman-Ford 路由协议改进得到的，其特点是利用目的节点序列号解决了DBF算法的路由环路和无穷计数问题。-dsdv the realization of the code under ns2. DSDV (Destination-Sequenced Distance-Vector) p
35016-35016
- dijkstra s algorithm
dijkstra
- 计算最短路的经典算法。在程序开发中经常用到-leastroad
xiaoyuandaohangxitong
- 本课程设计的内容为“校园导航”，校园平面图中取大学的11个常去地点，其略图如图1,图中已标出主要路线，各路线的长度如表１中所示。任务定义：找出从任意场所到达另一场所的最佳路径（最短路径）。显然要解决这一问题要用“邻接矩阵”来存储各点间的距离，然后用Ｄijkstra求出最短路径。-The content of the curriculum design for the " Campus Map" plan of the
XShortest
- a) 使用Dijkstra算法和Floyed算法. b) 对Dijkstra算法使用二叉堆[尝试Fibonacci Heap,发现效率不佳]. c) 对Dijkstra算法进行改进,堆中只保存目前可达的未标记节点,减少堆的大小从而提高堆操作效率.-fsdgjlkfghjhkl给句话、好几个和家干好、fgghjf
pieros
- Implemantation of Dijkstra in C-Implemantation of Dijkstra in C++
zuiduanlujing
- 数据结构中的迪杰斯特拉最短路径算法的代码，大作业之一-Data structure of Dijkstra' s shortest path algorithm code, the one
PathFinder
- 各种路径搜索算法，包括A星算法，迪克斯特拉算法等-A variety of path search algorithms, including A Star algorithm, Dijkstra algorithm
1
- 狄克算法 计算最短路径，1997B截断截面，简明扼要。-dijkstra
Guide
- Dijkstra算法实现的一个旅游线路查询程序-Dijkstra algorithm, a tourist line query procedures
dijkstra_homework
- 本例为dijkstra算法的一个应用。程序比较清晰简洁地运用循环解决了dijkstra算法中的集合元素判断问题。-The dijkstra algorithm were an application. Clear and concise procedures used to resolve the cycle dijkstra algorithm to determine the issue of a collection of ele
Dijkstrashortestpathalgorithm
- Dijkstra最短路线算法实验，实现欧洲旅游线路。此线路下花费最少费用-Dijkstra shortest route algorithm experiment, the realization of the European tourist routes. Under this line to spend at least the cost of
the_rout
- 图论中用得最多的最短路算法即Dijkstra，与Floyed算法。-Graph Theory with most that is the most short-circuit algorithm Dijkstra, and Floyed algorithm.
LL
- 用Dijkstra 算法实现最短路径求解，其中以自己假定的几个点组成的小网络图为基础。-Using Dijkstra shortest path algorithm for solving, in which a number of assumptions in their own points based on a small network map.
Dijkstra
- 本程序主要对操作系统中的死锁预防部分的理论进行实验。设计一个程序，该程序可对每一次资源申请采用银行家算法进行分配。 1) 设计多个资源：10； 2) 设计多个进程：8 ； 3) 设计银行家算法相关的数据结构； 4) 动态进行资源申请、分配、安全性检测并给出分配结果 -This procedure focused on the prevention of deadlock in the operating system
tulun
- 包括图论中经典的Dijkstra 汉密尔顿算法的图论程序包，非常的实用-Including graph theory in the classical Dijkstra algorithm Hamilton graph theory package, a very practical
Dijkstra
- 也是求最短路径的，它是一种通用的最短路径求解方法-Also for the shortest path, it is a kind of common shortest path algorithm
dijkstra
- 用C语言实现的最短路算法 算法描述清楚，未结合文件操作-Realized with C language algorithm for shortest path algorithm described in clear, no combination of file operations