搜索资源列表
zuiduanlujing
- 说明：这是个在公园里各景点之间最短路径的控制台程序。非常好，使用dijkstra,floyd算法-Note: This is the various attractions in the park where the shortest path between the console program. Very good, using dijkstra, floyd algorithm
Dijkstra
- 1 将顶点集V分成 S(开始只包含源点, S包含的点都是已经计算出最短路径的点) 和 V-S 集合(V-S 包含那些未确定最短路径的点) 2. 从V-S中选取这样一个顶点w: 满足经过S集合中任意顶点 v到w 的路径最短, 即 满足( 源到v的路径 + v到w的路径) 最小的那个w. 其中v 属于S, w属于S-V。将w 加入S, 并从V-S中移除w. 3. 如此反复，直到V-S变空集为止-1 to the vertex set V into S (the beginni
dijkstra001.pas
- algorithm Dijkstra in Delphi
dijkstra
- 利用dijistra算法获取最短路径的控制台小程序，压缩包中含有设计报告。-Use dijistra algorithm to obtain the shortest path of the console applet package contains the design report.
Dijkstra
- 迪杰斯特拉算法，利用贪心算法实现两点间最短路径的求解-Dijkstra Algorithm
Dijkstra
- Dijkstra杰斯拉特的贪心算法程序，实现含权有向图G=(V,E)中顶点到其余顶点的距离。-The greedy algorithm Dijkstra Jess Lats procedures with the right vertex to the rest of the distance from the vertex to Figure G = (V, E).
dv
- 迪杰斯特拉算法，求多个路由器之间最短距离-Dijkstra algorithm, find the shortest distance between multiple routers
Dijkstra
- Dijkstra算法求最短路径，通过读取TXT数据，显示计算机过，快速且精准-Dijkstra shortest path algorithm, by reading TXT data over a computer display, fast and accurate
Dijkstra
- 该代码简单实现了路由选择的链路状态算法。通过输入节点数，再输入节点间的开销后自动找出最少开销路径-The code implements a simple link-state routing algorithm. Automatically find the least cost path through the input nodes, and then enter the cost of inter-node
DIJandFloyd
- 输入一个邻接矩阵，求一个图的最短路径，2种方法：迪杰斯特拉发和弗洛伊德法-Enter an adjacency matrix, the shortest path of a graph, two kinds of methods: Dijkstra hair and Freud Act
exp_2
- 从文件读入一个有向正权图(n 个结点,m 条边)的权矩阵表示,输出这个图中某一结点到 其余各结点的最短路径长度。 程序必须使用 Dijkstra 算法,使用其他算法(比如穷举)不符合要求。-Reading from a file into a right to a positive figure (n nodes, m edges) of the weight matrix, said output this figure a junction to the length of the sh
Dalgo
- 给一个图，用Dijkstra算法寻找最短路径-Finding the shortest path in a graph using Dijkstra Algorithm
D
- 最短路径分析，Dijkstra经典路径算法，有向加权图-Dijkstra
shortest
- 利用Dijkstra算法计算任意两点间的最短路径 -the progress of calculate the shortest path
Dijkstra_4_27
- 迪杰斯特拉算法，找工作的时候自己敲得，希望有用-Dijkstra algorithm, knock when looking for a job, I hope useful