搜索资源列表
实验报告-最接近点对
- 关于最接近点对问题的基本思想运行结果测试平台以及源码-closest point on the basic issue of right thinking operating results and the source test platform
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
closestpoints
- 最短距离点对算法分治法实现 以及暴力算法的对比-Closest Distance Point Pairs Divide and Conque Algorithm
yiwei
- 完成一维的最接近点对问题，用的是分治算法进行的-The closest point to complete one-dimensional problem, using a partition algorithm of
Pair
- 完成一维，二维，的最接近点对问题，还有界面-Complete the one-dimensional, two-dimensional, the closest point on the issue, as well as the interface
Algorithm-design-code
- 一次大型的party最后节目是选取一位幸运人士；完成一维的最接近点对问题 第k小的元素-A large party last program is to select a lucky person complete the one-dimensional closest point problems small element of the k
Kruskal
- 用kruskal算法找最接近点对并分组。如我给出的测试数据，给定2000个多点，将最接近的点放在一个组里，最后分成九个组。程序可直接运行。-Algorithm used to find the closest point kruskal and groups. If I give the test data given over 2000 points, the closest point in a group, and finally divided into nine groups. Pro
theClosestPoint
- 寻找平面中最接近的点对，利用算法使时间复杂度接近于O（nlogn）-Find the the plane closest point pair algorithm time complexity close to O (nlogn)
KNN
- KNN算法分析及研究，将训练元组和测试元组看作是n维（若元组有n的属性）空间内的点，给定一条测试元组，搜索n维空间，找出与测试元组最相近的k个点（即训练元组），最后取这k个点中的多数类作为测试元组的类别。-Yuan KNN algorithm analysis and research, the training set and test set as a n d have the n properties (if a tuple) within the space of points, giv