最短路径-Dijkstra-欧洲旅行(详细分析+代码注释)

上传者: BornForIT | 上传时间: 2019-12-21 19:29:32 | 文件大小: 1.79MB | 文件类型: rar
欧洲铁路系统提供一些城市和这些城市之间的距离值,采用最短路径算法找出计算任意两个城市之间的花费最少的路径及这条路径的走法。

文件下载

资源详情

[{"title":"( 34 个子文件 1.79MB ) 最短路径-Dijkstra-欧洲旅行(详细分析+代码注释)","children":[{"title":"最短路径-Dijkstra-欧洲旅行","children":[{"title":"TravelingInEurope.suo <span style='color:#111;'> 24.50KB </span>","children":null,"spread":false},{"title":"Release","children":[{"title":"TravelingInEurope.exe <span style='color:#111;'> 34.50KB </span>","children":null,"spread":false},{"title":"TravelingInEurope.pdb <span style='color:#111;'> 667.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"TravelingInEurope.sln <span style='color:#111;'> 917B </span>","children":null,"spread":false},{"title":"TravelingInEurope.ncb <span style='color:#111;'> 2.82MB </span>","children":null,"spread":false},{"title":"最短路径-Dijkstra-欧洲旅行.doc <span style='color:#111;'> 416.00KB </span>","children":null,"spread":false},{"title":"TravelingInEurope","children":[{"title":"TravelingInEurope.vcproj <span style='color:#111;'> 4.67KB </span>","children":null,"spread":false},{"title":"Release","children":[{"title":"TravelingInEurope.exe.intermediate.manifest <span style='color:#111;'> 616B </span>","children":null,"spread":false},{"title":"BuildLog.htm <span style='color:#111;'> 6.40KB </span>","children":null,"spread":false},{"title":"vc90.pdb <span style='color:#111;'> 364.00KB </span>","children":null,"spread":false},{"title":"main.obj <span style='color:#111;'> 582.70KB </span>","children":null,"spread":false},{"title":"vc90.idb <span style='color:#111;'> 163.00KB </span>","children":null,"spread":false},{"title":"mt.dep <span style='color:#111;'> 65B </span>","children":null,"spread":false},{"title":"RailSystem.obj <span style='color:#111;'> 967.44KB </span>","children":null,"spread":false}],"spread":true},{"title":"RailSystem.h <span style='color:#111;'> 920B </span>","children":null,"spread":false},{"title":"City.h <span style='color:#111;'> 462B </span>","children":null,"spread":false},{"title":"RailSystem.cpp.bak <span style='color:#111;'> 6.85KB </span>","children":null,"spread":false},{"title":"Service.h <span style='color:#111;'> 284B </span>","children":null,"spread":false},{"title":"main.cpp <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"TravelingInEurope.vcproj.liyafang-PC.liyafang.user <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"TravelingInEurope.exe.intermediate.manifest <span style='color:#111;'> 621B </span>","children":null,"spread":false},{"title":"BuildLog.htm <span style='color:#111;'> 7.69KB </span>","children":null,"spread":false},{"title":"TravelingInEurope.exe.embed.manifest.res <span style='color:#111;'> 728B </span>","children":null,"spread":false},{"title":"vc90.pdb <span style='color:#111;'> 388.00KB </span>","children":null,"spread":false},{"title":"main.obj <span style='color:#111;'> 59.24KB </span>","children":null,"spread":false},{"title":"vc90.idb <span style='color:#111;'> 291.00KB </span>","children":null,"spread":false},{"title":"mt.dep <span style='color:#111;'> 65B </span>","children":null,"spread":false},{"title":"RailSystem.obj <span style='color:#111;'> 1.02MB </span>","children":null,"spread":false},{"title":"TravelingInEurope.exe.embed.manifest <span style='color:#111;'> 663B </span>","children":null,"spread":false}],"spread":false},{"title":"RailSystem.cpp <span style='color:#111;'> 6.85KB </span>","children":null,"spread":false},{"title":"services.txt <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false}],"spread":false},{"title":"Debug","children":[{"title":"TravelingInEurope.exe <span style='color:#111;'> 182.00KB </span>","children":null,"spread":false},{"title":"TravelingInEurope.ilk <span style='color:#111;'> 874.43KB </span>","children":null,"spread":false},{"title":"TravelingInEurope.pdb <span style='color:#111;'> 3.03MB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • u013286998 :
    很好用,参考了一下把数据结构的实验给做完了!
    2014-09-22
  • 星海聼空 :
    很好用,参考了一下把数据结构的实验给做完了!
    2014-09-22
  • u014092913 :
    很好,值得借鉴
    2014-06-24
  • 蔚蓝颖 :
    很好,值得借鉴
    2014-06-24
  • michaellittle :
    不错,代码可读性很强
    2014-05-15
  • michaellittle :
    不错,代码可读性很强
    2014-05-15
  • gglad :
    还好 有一部分可以借鉴的内容
    2012-08-10
  • gglad :
    还好 有一部分可以借鉴的内容
    2012-08-10
  • wangjiaomizi :
    很好的迪杰斯特拉算法,很实用,谢了
    2012-06-19
  • wangjiaomizi :
    很好的迪杰斯特拉算法,很实用,谢了
    2012-06-19

免责申明

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