图中任意两点间所有路径高效算法

上传者: s15885823584 | 上传时间: 2019-12-21 21:01:26 | 文件大小: 700KB | 文件类型: rar
算法中将一条线视为一个结点,采用广度优先搜索,利用树结构存储搜索结果,算法效率高,在武汉地铁11条线路190余个站点的线网图中测试,任意两点间的所有路径平均耗时0.2秒。只要对算法中的费用矩阵做调整,即可适用于公交等其他网络。

文件下载

资源详情

[{"title":"( 18 个子文件 700KB ) 图中任意两点间所有路径高效算法","children":[{"title":"PathSearch","children":[{"title":".project <span style='color:#111;'> 386B </span>","children":null,"spread":false},{"title":"mysql-connector-java-5.1.10-bin.jar <span style='color:#111;'> 707.25KB </span>","children":null,"spread":false},{"title":"src","children":[{"title":"com","children":[{"title":"tools","children":[{"title":"MyDatabase.java <span style='color:#111;'> 2.28KB </span>","children":null,"spread":false}],"spread":true},{"title":"main","children":[{"title":"Enter.java <span style='color:#111;'> 715B </span>","children":null,"spread":false},{"title":"PathSearch.java <span style='color:#111;'> 17.81KB </span>","children":null,"spread":false}],"spread":true},{"title":"bean","children":[{"title":"Line.java <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"SolutionTree.java <span style='color:#111;'> 287B </span>","children":null,"spread":false},{"title":"TreeNode.java <span style='color:#111;'> 5.84KB </span>","children":null,"spread":false},{"title":"Station.java <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true},{"title":".settings","children":[{"title":"org.eclipse.jdt.core.prefs <span style='color:#111;'> 598B </span>","children":null,"spread":false}],"spread":true},{"title":".classpath <span style='color:#111;'> 422B </span>","children":null,"spread":false},{"title":"bin","children":[{"title":"com","children":[{"title":"tools","children":[{"title":"MyDatabase.class <span style='color:#111;'> 4.30KB </span>","children":null,"spread":false}],"spread":true},{"title":"main","children":[{"title":"Enter.class <span style='color:#111;'> 1.48KB </span>","children":null,"spread":false},{"title":"PathSearch.class <span style='color:#111;'> 15.09KB </span>","children":null,"spread":false}],"spread":true},{"title":"bean","children":[{"title":"TreeNode.class <span style='color:#111;'> 5.04KB </span>","children":null,"spread":false},{"title":"Station.class <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"Line.class <span style='color:#111;'> 2.92KB </span>","children":null,"spread":false},{"title":"SolutionTree.class <span style='color:#111;'> 611B </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • hong小宋 :
    没具体数据源,数据源来源于数据库,不具有普遍性
    2019-11-03
  • lyzlln :
    和某个免费资源重复了,并且没什么用,里面只有一个word
    2018-10-14

免责申明

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