最短距离点对分治法实现 Java

上传者: darkhorsefly | 上传时间: 2019-12-21 19:38:07 | 文件大小: 357KB | 文件类型: rar
最短距离点对分治法实现 Java 代码实现 算法课程作业。 Java Swing 实现的图形化界面。 Eclipse 工程。 本人写的代码,故项目分数相对较高。望谅解

文件下载

资源详情

[{"title":"( 36 个子文件 357KB ) 最短距离点对分治法实现 Java","children":[{"title":"最短距离点对","children":[{"title":"最短距离点对算法实现.pdf <span style='color:#111;'> 317.38KB </span>","children":null,"spread":false},{"title":"ClosestPointGUI.jar <span style='color:#111;'> 25.09KB </span>","children":null,"spread":false},{"title":"closestpoints","children":[{"title":"src","children":[{"title":"closestpoint","children":[{"title":"ClosestPointAlgorithm.java <span style='color:#111;'> 4.54KB </span>","children":null,"spread":false},{"title":"ClosestPointNLgN.java <span style='color:#111;'> 4.89KB </span>","children":null,"spread":false},{"title":"TestClosestPoint.java <span style='color:#111;'> 3.39KB </span>","children":null,"spread":false},{"title":"ClosestPointNLgN_2.java <span style='color:#111;'> 6.28KB </span>","children":null,"spread":false},{"title":"ClosestPointN2.java <span style='color:#111;'> 1.73KB </span>","children":null,"spread":false}],"spread":true},{"title":"entity","children":[{"title":"MyPoint.java <span style='color:#111;'> 862B </span>","children":null,"spread":false},{"title":"MyPointPair.java <span style='color:#111;'> 427B </span>","children":null,"spread":false}],"spread":true},{"title":"gui","children":[{"title":"ClosestPointGUI.java <span style='color:#111;'> 4.37KB </span>","children":null,"spread":false},{"title":"action","children":[{"title":"RandomGeneratePoints.java <span style='color:#111;'> 819B </span>","children":null,"spread":false},{"title":"ComputeClosestPointsPairAction.java <span style='color:#111;'> 1.34KB </span>","children":null,"spread":false},{"title":"DivideAndConqueAction.java <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"OriginalAction.java <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"ClearPointsAction.java <span style='color:#111;'> 515B </span>","children":null,"spread":false},{"title":"ComputeMillionAction.java <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"CompareAlgorithmsAction.java <span style='color:#111;'> 2.94KB </span>","children":null,"spread":false}],"spread":true},{"title":"ScreenPanel.java <span style='color:#111;'> 1.94KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"bin","children":[{"title":"closestpoint","children":[{"title":"ClosestPointNLgN_2.class <span style='color:#111;'> 5.42KB </span>","children":null,"spread":false},{"title":"ClosestPointNLgN.class <span style='color:#111;'> 5.17KB </span>","children":null,"spread":false},{"title":"TestClosestPoint.class <span style='color:#111;'> 3.94KB </span>","children":null,"spread":false},{"title":"ClosestPointN2.class <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"ClosestPointAlgorithm.class <span style='color:#111;'> 4.59KB </span>","children":null,"spread":false}],"spread":true},{"title":"entity","children":[{"title":"MyPoint.class <span style='color:#111;'> 1.60KB </span>","children":null,"spread":false},{"title":"MyPointPair.class <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false}],"spread":true},{"title":"gui","children":[{"title":"ClosestPointGUI.class <span style='color:#111;'> 5.15KB </span>","children":null,"spread":false},{"title":"action","children":[{"title":"OriginalAction.class <span style='color:#111;'> 1.80KB </span>","children":null,"spread":false},{"title":"CompareAlgorithmsAction.class <span style='color:#111;'> 3.36KB </span>","children":null,"spread":false},{"title":"ComputeClosestPointsPairAction.class <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false},{"title":"DivideAndConqueAction.class <span style='color:#111;'> 1.82KB </span>","children":null,"spread":false},{"title":"RandomGeneratePoints.class <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"ComputeMillionAction.class <span style='color:#111;'> 2.28KB </span>","children":null,"spread":false},{"title":"ClearPointsAction.class <span style='color:#111;'> 702B </span>","children":null,"spread":false}],"spread":true},{"title":"ScreenPanel.class <span style='color:#111;'> 2.77KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":".classpath <span style='color:#111;'> 232B </span>","children":null,"spread":false},{"title":".project <span style='color:#111;'> 389B </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • sharonyshi :
    很不错的程序。。。谢谢。学习了
    2013-10-28
  • sharonyshi :
    很不错的程序。。。谢谢。学习了
    2013-10-28
  • liuqc617 :
    总体不错,说明注释比较少,算法可以借鉴
    2013-09-25
  • liuqc617 :
    总体不错,说明注释比较少,算法可以借鉴
    2013-09-25
  • qinqintao :
    还好,就是有图形界面
    2012-04-19
  • qinqintao :
    还好,就是有图形界面
    2012-04-19

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明