首页 开发技术 其它     /    K最短路算法实现(KSP)

K最短路算法实现(KSP)

上传者: dragonzht | 上传时间:2024/8/30 19:15:09 | 文件大小:83KB | 文件类型:rar
K最短路算法实现(KSP)
实现K最短路算法,包括双向图算法(删除法)、单向无环图算法(附加节点法)。
VC7、VC6都可通过编译。
算法原理可在CSDN上找到一堆论文。

文件下载

资源详情

[{"title":"(47个子文件83KB)K最短路算法实现(KSP)","children":[{"title":"main.cpp <span style='color:#111;'>511B</span>","children":null,"spread":false},{"title":"test_bi1.txt <span style='color:#111;'>567B</span>","children":null,"spread":false},{"title":"代码说明.txt <span style='color:#111;'>734B</span>","children":null,"spread":false},{"title":"input.txt <span style='color:#111;'>569B</span>","children":null,"spread":false},{"title":"test_bi1.JPG <span style='color:#111;'>46.42KB</span>","children":null,"spread":false},{"title":"bigraph","children":[{"title":"dijkstra.cpp <span style='color:#111;'>5.80KB</span>","children":null,"spread":false},{"title":"edge.h <span style='color:#111;'>435B</span>","children":null,"spread":false},{"title":"node.h <span style='color:#111;'>297B</span>","children":null,"spread":false},{"title":"graph_if.h <span style='color:#111;'>239B</span>","children":null,"spread":false},{"title":"graph.h <span style='color:#111;'>538B</span>","children":null,"spread":false},{"title":"deletionksp.h <span style='color:#111;'>651B</span>","children":null,"spread":false},{"title":"linkbased.h <span style='color:#111;'>211B</span>","children":null,"spread":false},{"title":"graph.cpp <span style='color:#111;'>1.16KB</span>","children":null,"spread":false},{"title":"linkbased.cpp <span style='color:#111;'>345B</span>","children":null,"spread":false},{"title":"deletionksp.cpp <span style='color:#111;'>4.59KB</span>","children":null,"spread":false},{"title":"short_path.cpp <span style='color:#111;'>2.33KB</span>","children":null,"spread":false},{"title":"dijkstra.h <span style='color:#111;'>743B</span>","children":null,"spread":false},{"title":"edge.cpp <span style='color:#111;'>311B</span>","children":null,"spread":false},{"title":"node.cpp <span style='color:#111;'>697B</span>","children":null,"spread":false}],"spread":false},{"title":"ksp.vcproj <span style='color:#111;'>6.98KB</span>","children":null,"spread":false},{"title":"short_path.h <span style='color:#111;'>376B</span>","children":null,"spread":false},{"title":"uigraph","children":[{"title":"input.txt <span style='color:#111;'>144B</span>","children":null,"spread":false},{"title":"dijkstra.cpp <span style='color:#111;'>3.23KB</span>","children":null,"spread":false},{"title":"edge.h <span style='color:#111;'>291B</span>","children":null,"spread":false},{"title":"node.h <span style='color:#111;'>297B</span>","children":null,"spread":false},{"title":"graph_if.h <span style='color:#111;'>239B</span>","children":null,"spread":false},{"title":"graph.h <span style='color:#111;'>540B</span>","children":null,"spread":false},{"title":"deletionksp.h <span style='color:#111;'>517B</span>","children":null,"spread":false},{"title":"graph.cpp <span style='color:#111;'>649B</span>","children":null,"spread":false},{"title":"deletionksp.cpp <span style='color:#111;'>2.97KB</span>","children":null,"spread":false},{"title":"short_path.cpp <span style='color:#111;'>2.42KB</span>","children":null,"spread":false},{"title":"dijkstra.h <span style='color:#111;'>555B</span>","children":null,"spread":false},{"title":"edge.cpp <span style='color:#111;'>216B</span>","children":null,"spread":false},{"title":"node.cpp <span style='color:#111;'>697B</span>","children":null,"spread":false}],"spread":false},{"title":"test_ui1.txt <span style='color:#111;'>166B</span>","children":null,"spread":false},{"title":"ksp.sln <span style='color:#111;'>966B</span>","children":null,"spread":false},{"title":"scan","children":[{"title":"scan.l <span style='color:#111;'>1.79KB</span>","children":null,"spread":false},{"title":"parse.h <span style='color:#111;'>191B</span>","children":null,"spread":false},{"title":"scan_error.c <span style='color:#111;'>399B</span>","children":null,"spread":false},{"title":"scan_error.h <span style='color:#111;'>327B</span>","children":null,"spread":false},{"title":"parse.c <span style='color:#111;'>21.97KB</span>","children":null,"spread":false},{"title":"scan.c <span style='color:#111;'>39.21KB</span>","children":null,"spread":false},{"title":"gram.bat <span style='color:#111;'>187B</span>","children":null,"spread":false},{"title":"scan_assist.h <span style='color:#111;'>454B</span>","children":null,"spread":false},{"title":"parse.y <span style='color:#111;'>873B</span>","children":null,"spread":false},{"title":"scan_assist.c <span style='color:#111;'>3.86KB</span>","children":null,"spread":false}],"spread":true},{"title":"test_ui1.JPG <span style='color:#111;'>7.83KB</span>","children":null,"spread":false}],"spread":true}]

评论信息

  • Lxkiii_net:
    谢谢,很好的算法2017-12-13
  • sinat_30061475:
    很好用的,最近刚好在学习。2017-09-26
  • sinat_29987659:
    代码很完整,帮助很大~谢谢~2015-09-17
  • kduanlu:
    非常棒,很实用的K短路算法2015-08-19
  • qq_30179505:
    用过了,值得借鉴!2015-08-16

免责申明

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