20e83fe41167001b1fc8c86c12fb3d87

来自「在eclipse下开发的求平面上两点之间的最短距离。通过随机在平面上生成无数个点」· 代码 · 共 22 行

package distance;
import java.io.IOException;
public class Test {
	//public static int NumOfPoints;

	public static void main(String[] args) throws IOException{		
		ProducingPoints d = new ProducingPoints();
		int num = d.getNumOfPoints();
		Point[] ad = new Point[num];			
		ad = d.getPoints(num);		
		for(int i = 0; i < num; i++){
			System.out.println("num " + i + "  x:" + ad[i].getXCoordinate()+ " y:" + ad[i].getYCoordinate());
		}	
		ShortestDistance sd = new ShortestDistance();
		sd.findShortestDistance(ad,0,ad.length - 1);
		System.out.println("final point1 is:" + ShortestDistance.selectPoint1);
		System.out.println("final point1 is:" + ShortestDistance.selectPoint2);
		System.out.println("final point1 is:" + ShortestDistance.minDistance);
		System.exit(0);
	}
}