Search - shortest path

Search - shortest path - List

[Console] 城市信息及最短路径查询系统 DL : 2: 用C语言写的《城市信息及最短路径查询系统》，图形界面，功能比较齐全。-C language book, "Cities and the shortest path query system", a graphical interface, functions more complete.
Date : 2008-10-13 Size : 171.92kb User : 粼
[Console] 城市信息及最短路径查询系统 DL : 0: 用C语言写的《城市信息及最短路径查询系统》，图形界面，功能比较齐全。-C language book, "Cities and the shortest path query system", a graphical interface, functions more complete.
Date : 2025-12-31 Size : 172kb User : 粼
[Console] shorest DL : 0: dijistra最短路经算法的实现。根据以文件输入图中各个节点的距离关系，然后运用算法求出a点到b点的最短路径-dijistra realize the shortest path algorithm. According to the file input graph in each node the distance relationship, and then use algorithms to derive a point to b point shortest path
Date : 2025-12-31 Size : 1kb User : signal
[Console] Floyd_Warshall DL : 0: Floyd_Warshall algorithm 用来求解多源点最短路径问题-Floyd_Warshall algorithm used to solve the multi-source shortest path problem
Date : 2025-12-31 Size : 7kb User : superhero122
[Console] Bellman_Ford DL : 0: Bellman_Ford 算法，求解带有负权重的边的单源点最短路径问题-Bellman_Ford algorithm, solving with negative edge weights of the single-source shortest path problem
Date : 2025-12-31 Size : 10kb User : superhero122
[Console] RailSystem DL : 0: SSD5课程实验中求欧洲旅行的乘车最短路径的实验答案-SSD5 course experiments for the European travel the shortest path of travel of the experiment the answer
Date : 2025-12-31 Size : 128kb User : 王鹏
[Console] spfa DL : 0: 求单源点最短路径效率最高的算法，包括2个样例程序和测试数据。-For single-source shortest path algorithm for the highest efficiency, including two sample procedures and test data.
Date : 2025-12-31 Size : 60kb User : ly
[Console] ass2_088766_wangxiaofeng_325 DL : 0: 最短路径算法几个城市之间的距离输出的是一个城市到另一个城市的距离-Shortest path algorithm in several cities the distance between the output of a city to another city in the distance
Date : 2025-12-31 Size : 7kb User : 王晓峰
[Console] mazebestpath DL : 0: 迷宫最短路径问题，采用递归算法实现，C语言学习者的经典题目-Maze shortest path problem, the use of recursive algorithm
Date : 2025-12-31 Size : 1kb User : 骆俊武
[Console] vc6.0shorttestpathsearch DL : 0: 货郎担最短路径生成最短路径生成的算法不计其数其中很多用回溯法回溯法不错不过很多新手写哦时候掌握不好效率上传一个效率高的版本-Traveling Salesman generate the shortest path shortest path algorithm to generate many of which used numerous retrospective law retrospective laws, however good a lot of time to master the new Oh poor handwriting efficiency upload a version of efficient
Date : 2025-12-31 Size : 8kb User : 杨红尘
[Console] God DL : 0: 用Windows控制台程序实现A*算法在交通网络中寻找最短路径的应用，并附有实际的测试数据，程序已经调过没有问题。-Windows Console Application with the realization of A* algorithm to find the shortest path transport network applications, along with the actual test data, the program has emphasized there is no problem.
Date : 2025-12-31 Size : 1.12mb User : 丁小寻
[Console] zuiduanlujing DL : 0: 说明：这是个在公园里各景点之间最短路径的控制台程序。非常好，使用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
Date : 2025-12-31 Size : 209kb User : 将军
[Console] dijiesiktra DL : 0: 按路径长度递增次序产生最短路径算法：　　把V分成两组：　　（1）S：已求出最短路径的顶点的集合　　（2）V-S=T：尚未确定最短路径的顶点集合　　将T中顶点按最短路径递增的次序加入到S中，　　保证：（1）从源点V0到S中各顶点的最短路径长度都不大于　　从V0到T中任何顶点的最短路径长度　　（2）每个顶点对应一个距离值　　S中顶点：从V0到此顶点的最短路径长度　　T中顶点：从V0到此顶点的只包括S中顶点作中间　　顶点的最短路径长度 -Path length produced by increasing the order of the shortest path algorithm: the V into two groups: (1) S: find the shortest path of vertices has a collection of (2) VS = T: not yet determined the shortest path to the vertex set of vertices by the shortest T incremental path to S in order to ensure that: (1) from the source S of the vertices V0 to the shortest path length is not greater than from any vertex V0 to T the shortest path length (2) Each vertex corresponds to a value of S in the vertex distance: from V0 to this vertex the shortest path length of T in the vertex: the vertex from V0 to this point for the purpose only S in the middle vertex of the shortest path length
Date : 2025-12-31 Size : 1kb User : 马值
[Console] Dijkstra DL : 0: 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 beginning contains only the source, S contains the points are already calculated the shortest path points) and set VS (VS contains the points that determined the shortest path) 2. From the VS select a vertex w: S set to meet through any vertex v shortest path to w that satisfy (the path of the source to the v+ v to w in the path of) the smallest one that w. v belong to S, w belongs to SV. The w added S, and removed from the VS w. 3. So repeatedly, until the empty set up VS
Date : 2025-12-31 Size : 785kb User : bob
[Console] shool DL : 0: 控制台程序，用c++写的，一个兰州交通大学，校园导游程序，能够寻找最短路径，能够以字符界面与用户进行交互-Console program, written using c++, a Lanzhou Jiaotong University, the campus tour program, to find the shortest path, able to interact with the user interface characters
Date : 2025-12-31 Size : 1.03mb User : aiqier—liu
[Console] dijkstra DL : 0: 利用dijistra算法获取最短路径的控制台小程序，压缩包中含有设计报告。-Use dijistra algorithm to obtain the shortest path of the console applet package contains the design report.
Date : 2025-12-31 Size : 553kb User :
[Console] Floyd DL : 0: 图的一个最短路径，用的Floyd实现，好型挺好用的-A shortest path in the graph, with the Floyd achieved, the good type good use aaaaaaaaa
Date : 2025-12-31 Size : 50kb User : madewei
[Console] Floyd0 DL : 0: 用Floyd实现图中最短路径的查找，可以重复使用，循环嵌套，实用的小程序-Floyd to achieve the shortest path to the search, can be reused, nested loop, and practical small procedures
Date : 2025-12-31 Size : 50kb User : madewei
[Console] CPP-LYG-Journey DL : 0: 一个用C++写的课程设计，关于旅游的一个系统，用到了最短路径算法-A with C++ write curriculum design of a system on tourism, use the shortest path algorithm
Date : 2025-12-31 Size : 21kb User : wangliang
[Console] shortest DL : 0: 利用Dijkstra算法计算任意两点间的最短路径 -the progress of calculate the shortest path
Date : 2025-12-31 Size : 161kb User : 林可儿

« 12 »