最小生成树
疯的世界
这个作者很懒,什么都没留下…
展开
-
poj_1789 Truck History
Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12456 Accepted: 4713 题目链接:http://poj.org/problem?id=1789 Description Advanced Cargo原创 2012-08-03 18:09:00 · 619 阅读 · 0 评论 -
poj_2485 Highways
Highways Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16037 Accepted: 7460 题目链接:http://poj.org/problem?id=2485 Description The island nation of原创 2012-08-03 18:35:34 · 747 阅读 · 0 评论 -
poj 2349 Arctic Network
Arctic Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5764 Accepted: 2007 题目链接:http://poj.org/problem?id=2349 Description The Department原创 2012-08-05 09:49:31 · 1022 阅读 · 0 评论 -
poj_2560 Freckles
Freckles Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5248 Accepted: 2720 题目:http://poj.org/problem?id=2560 Description In an episode of the Di原创 2012-07-28 14:47:29 · 669 阅读 · 0 评论 -
poj_2560 Freckles
Freckles Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5248 Accepted: 2720 题目:http://poj.org/problem?id=2560 Description In an episode of the Di原创 2012-07-27 15:53:03 · 551 阅读 · 0 评论 -
poj_2075 Tangled in Cables
Tangled in Cables Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4841 Accepted: 1947 题目连接:http://poj.org/problem?id=2075 Description You are the原创 2012-08-16 18:03:27 · 1033 阅读 · 0 评论 -
prim算法
最小生成树:在一个具有几个顶点的连通图G中,如果存在子图G'包含G中所有顶点和一部分边,且不形成回路,则称G'为图G的生成树,代价最小生成树则称为最小生成树。•算法过程–从单一顶点的树T开始–不断加入耗费最小的边(u, v),使T∪{(u, v)}仍为树 ——u、v中有一个已经在T中,另一个不在T中//prim算法求最小生成树 #include #include #include #defi原创 2012-08-09 23:35:59 · 803 阅读 · 0 评论 -
find the mincost route
find the mincost route Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1286 Accepted Submission(s): 517 Problem Description 杭州有N原创 2013-05-29 20:40:08 · 748 阅读 · 0 评论