搜索资源列表
KSP dijkstra第k条最短路径算法
- dijkstra第k条最短路径算法 Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-dijkstra Kth shortest path algorithm
select
- 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-
Select-the-Kth-number-by-3-methods
- 用三种方法实现，随机生成的一堆数中选出Kth个数，包括简单选择排序、冒泡排序、快速排序-Using three methods, the number of randomly generated a bunch of selected Kth number, including the simple selection sort, bubble sort, quicksort
kth
- 此程序可实现在图面中批量替换各种类型的块,处理图时有用.-This program enables batch replace various types of blocks in the drawing, the useful processing of FIG.
kth-min-mumbers
- 用来查询最小最小的k个数,细算法是非常有效和精准的，供参考-to search the kth number in the large numbers,it is very fast and effective
knniris
- this file which i get for kth nearest neigbour
dd2423_LAB_FILES
- DD2423 IMAGE ANALYSIS AND COMPUTER VISION LAB FILES
number-for--array
- 写一段程序，找出数组中第k大小的数，输出数所在的位置。-writing a project,which can find the kth bigest number, and put out the place of the number
CPP-Findkth
- 如果某个整数x（x> 1）存在一个数组中，则2*x+1和3*x+1也必定在这个数组中，已知1为该数组中的元素，现给定一个整数k（k> 1），要求求出该数组中的第k大的数。例如a[3] {1,2,3}，当k 1，则返回3；k 2，则返回2；k 3，则返回1；k> 4或k<1，输出错误。-If an integer x (x> 1) exists in an array, then 2* x+ 1 and 3* x+ 1 must also be in this a
第k大数
- C程序设计代码，c语言从入门到精通第二版，陈锐(kth biggest number)