Description: Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to the nearest point on
To Search:
File list (Check if you may need any files):
NearestPoint\.classpath
............\.project
............\com\mainframe\Mainframe.class
............\...\.........\Mainframe.java
............\...\point\NearPoint.class
............\...\.....\NearPoint.java
............\...\.....\Point.class
............\...\.....\Point.java
............\...\util\algorithm\QSort.class
............\...\....\.........\QSort.java
............\...\....\.........\ShortestPath.class
............\...\....\.........\ShortestPath.java
............\...\....\algorithm
............\...\mainframe
............\...\point
............\...\util
............\com
NearestPoint
Download