搜索资源列表
dijkstra_simple
- 一个简单的Dijkstra算法的实现,用一个数组来表示邻接矩阵-a simple realization of the Dijkstra algorithm, using an array said adjacency matrix
ksp
- 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path
DKS
- 运用dijkstra算法计算最短路的程序，输入点数和连结矩-dijkstra algorithm using the most short-circuit the process, the input points and link Moment
Dijkstra111
- 这是由Dijkstra算法实现的最短路径的实现，Ｃ＋＋编码，还有包括最小生成树的生成-This is the Dijkstra algorithm to achieve the shortest path to the realization of C++ coding, include the minimum spanning tree Generation
Dijkstra_Huffman_Prim
- prim算法Huffman算法Dijkstra算法和实验报告-prim algorithm Huffman algorithm Dijkstra algorithm and experimental report
Dijkstraalgorithm15nodes
- Dijkstra s algorithm,最多15 个点-Dijkstra's algorithm, a maximum of 15 points
Dijkstra1
- 利用MATLAB来实现Dijkstra算法模拟了路由选择协议-using MATLAB to achieve the Dijkstra algorithm to simulate the Routing Protocol
zhoumao
- 换乘次数最少是乘客出行时考虑的首要因素。描述了传 统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段 距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Descr iption of the
DijkstraSource
- Dijkstra s Algorithm -- Shortest path (Dijkstra s Algorithm)-Dijkstra s Algorithm-- Shortest path (Dijkstra s Algorithm)
Dijkstra
- 求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列-Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence
source
- 单源点最短路径算法 * 本程序用来实现单源点最短路径（E.Dijkstra）算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * 每条边的两个顶点和权值由用户输入，格式：1 2 20 * 程序默认源点为第一个顶点 * 算法完成后输出路径长度和路径上的顶点 * 格式为：路径长度：目标顶点<-经过的顶点...<-源点-Single-source shortest path
Arithmetic
- 包含Dijkstra、Floyd、kruskal、动态规划、随机数生成等MATLAB程序-Contains Dijkstra, Floyd, kruskal, dynamic programming, random number generator, such as MATLAB program
5
- Dijkstra’s算法的实现，还有具体的实验报告，欢迎下载-Dijkstra s algorithm realize, there are specific experimental reports, welcome to download
Dijkstra_simulate
- Dijkstra算法可视化模拟,可输入节点!可仿真路由表产生过程-Dijkstra algorithm visualization simulation, enter the node! Routing table can be generated simulation process
shortest
- 本程序编写了一个dijkstra算法求解最短路问题，在turboc2.0环境下编译成功。-This procedure has prepared a Dijkstra shortest path algorithm to solve problems in the compiler environment turboc2.0 success.
Dijkstra
- 求最短路径的好源码，强力推荐下载。求路径-The shortest path for a good source, strongly recommended to download. Seek the path of
shortest_paths
- 单源点最短路径的算法 dijkstra的经典算法-Single-source shortest path algorithm Dijkstra s classic algorithm
zuiduanlujing
- vb环境下用dijkstra方法编的球最短路径问题-vb environment Dijkstra method made use of the ball the shortest path problem