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: In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic.) This includes the cases of finding the minimum, maximum, and median elements. There are worst-case linear time selection algorithms. Selection is a subproblem of more complex problems like the nearest neighbor problem and shortest path problems.
Platform: |
Size: 32768 |
Author:Lemor |
Hits:
Search - kth shortest path