poj+pku图论、网络流入门题总结、汇总(国外英语资料).doc

poj+pku图论、网络流入门题总结、汇总(国外英语资料).doc

  1. 1、本文档共23页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
pojpku图论、网络流入门题总结、汇总(国外英语资料)

poj+pku图论、网络流入门题总结、汇总(国外英语资料) POJ PKU graph theory, network flow into the door, summary and summary , 07 2009, 22:29 on Monday, 06 POJ 2449, Remmarguts, Date (medium) Http:///JudgeOnline/problem? Id=2449? The classic problem: K short circuit Solution: dijkstra+A* (REC), a lot of ways Related: /JudgeOnline/showcontest, contest_id=1144? The title is also included in the search recommendation POJ 3013 - Big Christmas Tree (Foundation) Http:///JudgeOnline/problem? Id=3013? Some of the most simple and short, but this problem had, in need of better speed and accuracy but also pay attention to the program. Solution: Dijkstra POJ 3463 - Sightseeing (medium) Http:///JudgeOnline/problem? Id=3463? The number of shortest path and shortest path than the big 1 road Solution: need to really understand Dijkstra POJ 3613 - Cow Relays (harder) Http:///JudgeOnline/problem? Id=3613? As for the shortest path through N edges. Solution: Floyd + multiplication, greed POJ 3621 - Sightseeing Cows (medium) Http:///JudgeOnline/problem? Id=3621? As for a loop, joy / total path maximum value Solution: parameter search + the shortest path (MS, the original Bellman TLE, using SPFA before) POJ 3635 - full tank? (medium) Http:///JudgeOnline/problem? Id=3635? The shortest path deformation Solution: wide search Related: /hnu_reason/blog/item/086e3dccfc8cb21600e9286b.html Spanning tree problem The basic spanning tree doesnt come up POJ 1639 - Picnic Planning (harder) Http:///JudgeOnline/problem? Id=1639? The minimum spanning tree vertex degree Limited Solution: greedy + prim/kruskal POJ 1679 - The Unique MST (Foundation) Http:///JudgeOnline/problem? Id=1679? The MST is the only Solution: prim on the line, but error prone problem POJ 2728 - Desert King (medium) Http:///JudgeOnline/problem? Id=2728? The so-called optimal ratio spanning tree Solution: parameter search + prim POJ 3164 - Command Network (hard) Http:///JudgeOnline/problem? Id=3164? The smallest tree Solution: Liu Zhu algorithm, the possibili

文档评论(0)

jgx3536 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档