搜索资源列表
Nearestpoint
- 求最近点对问题, 求最近点对问题。-Nearest point on the issue of demand, and the nearest point on the issue, and the nearest point on the issue.
Nearestpoint
- 最近点对算法的实现,用穷举法证明程序的正确性。-Nearest point of the algorithm, the exhaustive method to prove the correctness of the procedure.
Cpair
- 最近点对算法,穷举法证明算法的正确性,可供学习和参考-Nearest point of the algorithm, exhaustive method to prove the correctness of algorithms for learning and reference
random
- 含有随机算法,素数测试,求最近点对的随机算法-Contains a random algorithm, prime number test, seek the nearest point of the random algorithm
ClosetPair
- 实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点,并利用该算法求解。此外,要求支持图形界面的算法输入与输出。在此基础上,添加n^2级算法的实现,并比较相同规模下,两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically gen
devide_conquer
- 分治法解最近点对问题:首先输入点的个数,然后输入点的坐标,输出先是根据x的坐标对点进行排序,然后输出最近点对的距离。-Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of
Nearest
- 分别利用分治法及穷举法求解最近点对问题,输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.
dbPoint.c
- C语言实现,分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了,改传背包问题了。-leastport
CLOSESTPAIR
- 最近点对问题,求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
PointPair
- 根据分治算法实现求平面上最近点对的复杂度为(nlgn)的算法 有图形界面,能通过鼠标输入点-Under sub-rule algorithm seeking the nearest point on the plane of the complexity of (nlgn) algorithm for graphical interface, through mouse input points
zuijingdiandui
- 基于MFC单文档实现的最近点对的算法,是图形界面的-MFC single document based on the closest point to the realization of the algorithm is a graphical interface
NearestPoint
- 最近点对问题是许多算法书籍必有得一个要探讨的问题,本人基于王晓军的《算法设计与分析》实现了分治法及传统法的图形化演示程序,大家可以看到两者的算法性能的比较。-The nearest point of the problem is that many books there must be a method to explore the question, I based Wang Xiaojun' s " Algorithm Design and Analysis of"
nearestneighbor
- 用C编写的一个求最近点对的算法,不是很实用,但是对刚开始学习算法的人可能会有点帮助-C code .i wish this can do a little help to your study.
cloestPair
- 最近点对程序,java实现。可以计算平面内的最近点对-The nearest point on the program, java implementation. Can calculate the closest point on plane
suanfa
- 请选择操作: 1. 最近点对 2. 假币问题 3. 堆排序 4. 全源最短路径-Please choose: 1. Nearest points on 2. Counterfeiting problem 3. Heap sort 4. All source shortest path
zuijindianduierwei
- 算法 最近点对问题 二维的解决 很简单 值得-Closest point algorithm to solve the problem is very simple two-dimensional worth a look
zuijindianduiyiwei
- 算法 最近点对 一维问题解决 可以下载下来研究下-Closest point algorithm to solve one-dimensional problem under study can be downloaded