Location:
Search - k shortest path
Search list
Description: 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path
Platform: |
Size: 12632 |
Author: 包海洁 |
Hits:
Description: 用普里姆算法借助堆排序实现最短路径的查找，用C语言实现-with Primbetov heap sorting algorithm using the shortest path to achieve the search, using C language
Platform: |
Size: 29696 |
Author: 魏永锋 |
Hits:
Description: 克鲁斯卡尔算法,求最短路径-Kelushikaer algorithm, for the shortest path
Platform: |
Size: 2048 |
Author: 许良 |
Hits:
Description: K条路 算法
计算最短路径
CVC8-K road shortest path algorithm CVC8
Platform: |
Size: 12288 |
Author: errantry |
Hits:
Description: 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path
Platform: |
Size: 12288 |
Author: 包海洁 |
Hits:
Description: 本程序是K条最短路算法测试程序,陈艳艳老师的K条路算法。程序求3条最短路，约束条件值可以设定,约束值越小，多路径共用路段越多。-Article K of the procedure is the shortest path algorithm to test procedures, Yan-Yan Chen K teacher path algorithm. Procedures for the three short-circuit, constraints can be set value, the smaller the value constraint, multi-path section of the more common.
Platform: |
Size: 105472 |
Author: 马踏 |
Hits:
Description: kth算法的实现，可找出第k次最短路径，给出优化方案-KTH algorithm can find the first k-shortest path is given to optimize the program
Platform: |
Size: 12288 |
Author: gs_chen |
Hits:
Description: K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。-K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic.
Platform: |
Size: 49152 |
Author: wei |
Hits:
Description: 求前k条最短路径,本程序可用于求地图的路线安排和前k个最短路径分配问题，十分管用，可用于2000个点的计算-find out the kth shortest path
Platform: |
Size: 5120 |
Author: 翟晓宇 |
Hits:
Description: K 最短路径
K 最短路径 代码
-improved routing algorithm used to find from source to destination node of the first k Shortest Path
Platform: |
Size: 123904 |
Author: laodu |
Hits:
Description: 求解K短路问题的一种创新算子的单亲遗传算法源程序，该程序需要一个distance.txt文本文件，从中读取任意两点间距离数据。本程序所解决的为有26个节点的任意两点间K短路问题。-Solving K shortest path problem in an innovative operator of single-parent genetic algorithm source code, the program requires a distance.txt text file, read from the distance between any two points in the data. This procedure resolved to have 26 nodes K shortest path problem between any two points.
Platform: |
Size: 4096 |
Author: zuowu |
Hits:
Description: K短路算法的最新求法，是每个学习程序设计的同志必备的知识！-K shortest path method for finding the latest, the design of each learning process essential knowledge, Comrade!
Platform: |
Size: 176128 |
Author: wenhong |
Hits:
Description: K最短路问题。大家现在已经知道了如何求单源点最短路径问题，但在实际应用中，有时候需要除了需要知道最短路径外，尚需求解次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序。如在通信网络中，有时候某条线路中断，则需要找一个替代的方案，这就需要找到几条最短路以备不时之需。这样一类多条最短路问题即称为K最短路问题。-K shortest path problem. We now know how to find single source shortest path problem, but in practice, sometimes need to know the shortest path in addition to, but still need to solve the second or third most short path, that is, to know more than most short and to increase the length of the order of discharge. If the communication network, and sometimes interrupted on certain routes, you need to find an alternative solution, which needs to find the shortest path for a rainy day a few. As a class of more than one shortest path problem is known as the K shortest path problem.
Platform: |
Size: 28672 |
Author: 陈默 |
Hits:
Description: Yen 算法求解最短路径 附加测试代码 例程-Yen shortest path algorithm
Platform: |
Size: 11264 |
Author: Andy |
Hits:
Description: 参考《Multiple Object Tracker Using K-Shortest Paths》实现的代码，使用K最短路径实现多目标追踪功能。-Reference " Multiple Object Tracker Using K-Shortest Paths" to achieve code, use the shortest path K multi-target tracking capabilities.
Platform: |
Size: 3415040 |
Author: 黄凯 |
Hits:
Description: N最短路径是K最短路径（KSP）的变种，KSP指的是DAG中单源路径中前K条最短的路径-
N shortest path is the shortest path (KSP) of K, KSP refers to the DAG in the single source path of the shortest path in the former K
Platform: |
Size: 72704 |
Author: 凌燕 |
Hits:
Description: 第k短路径研究论文，有经过中间节点情况，可以是固定顺序，也可以非固定-K-shortest path research papers, there are cases through intermediate nodes, which can be fixed sequence to be non-fixed
Platform: |
Size: 176128 |
Author: |
Hits:
Description: 使用蛙跳算法，对第k短路径问题进行研究，包含经过中间节点的情况，可以是固定顺序也可以不固定顺序。-Use leapfrog algorithm, k-shortest path problem studied, including the case through an intermediate node, which can be fixed to be the order of the order is not fixed.
Platform: |
Size: 3084288 |
Author: |
Hits:
Description: 可以自行设立k值实现多条最短路径计算，结果经验证算法无误(The K value can be set up to realize the calculation of the shortest path. The result is proved to be correct)
Platform: |
Size: 4096 |
Author: 你懂我幽默
|
Hits:
Description: k最短路径实现
用K条最短路径来优化网络传输方式，提高网络的实时性，是在Dijkstra最短路径的基础上，优化备选路径的生成方式，提高信息传输速度。在中继节点故障的情况下，放弃最短路径，使用源节点的次最短路径进行信息传输，而不使用故障节点的前一节点的次最短路径。(K shortest path implementation
The shortest path of K bar is used to optimize the network transmission mode and improve the real-time performance of the network. On the basis of the shortest path of Dijkstra, optimize the generation mode of the alternative path and improve the information transmission speed.In the case of the failure of the relay node, the shortest path is given, and the shortest path of the first node of the failure node is not used.)
Platform: |
Size: 3072 |
Author: huaner92
|
Hits: