스크랩

각 복사하기 버튼을 이용하여 블로그나 카페에 HTML 형식으로 붙여넣기 하실 수 있습니다.

소스복사하기

ClosestPair(근접쌍) 알고리즘 - 분할정복

다운로드: iconClosestPair.zip


 
본문내용
Point[] xSorted = new Point[numberOfPoints];
Point[] ySorted = new Point[numberOfPoints];
System.arraycopy(points, 0, xSorted, 0, numberOfPoints);
System.arraycopy(points, 0, ySorted, 0, numberOfPoints);
Arrays.sort(xSorted);
Arrays.sort(ySorted, new PointComparatorByY());

double minDistance2 = closestPairDNC(xSorted, ySorted);
System.out.printf("distance from closestPairDNC = %.2f \n\n",
minDistance2);
assert (minDistance1 == minDistance2);
2024-03-30 00:54:31 211.234.109.229/data/data_scrap.html 최근 수정일: 2019-11-06 15:55:18. 총퀴리수 : 3 총쿼리시간 : 0.00217 [0.00069]/[ DB:report] select count(*) AS CNT from psCart where SessNum='20240330005431424414'; [0.00049]/[ DB:report] SELECT seq FROM psRlist WHERE rpID=721802; [0.00099]/[ DB:report] SELECT * FROM psReport WHERE rpID=721802;