最小生成树
文章平均质量分 86
非常可乐(이녕)
贵在自知,贵在坚持
展开
-
hdu 1863 畅通工程【kruskal & prim】
畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21395 Accepted Submission(s): 9206 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都原创 2015-08-11 15:55:49 · 393 阅读 · 0 评论 -
poj 1258 Agri-Net 【Prim&Kruskal】
Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 45169 Accepted: 18547 Description Farmer John has been elected mayor of his town! One of his campaig原创 2015-08-11 10:03:18 · 434 阅读 · 0 评论 -
hdu 3371 Connect the Cities【kruskal&prim】
Connect the Cities Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13607 Accepted Submission(s): 3670 Problem Description In 2100, s原创 2015-08-11 15:33:16 · 417 阅读 · 0 评论 -
poj 1251 Jungle Roads【prim & kruskal】
Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21365 Accepted: 9873 Description The Head Elder of the tropical island of Lagrishan has a原创 2015-08-11 18:29:24 · 384 阅读 · 0 评论 -
hdu 1875 畅通工程再续【prim&kruskal】
畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19406 Accepted Submission(s): 6079 Problem Description 相信大家都听说一个“百岛湖”的地方吧,百岛湖原创 2015-08-11 11:35:20 · 315 阅读 · 0 评论 -
poj 2421 Constructing Roads【kruskal & prim】
Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20892 Accepted: 8820 Description There are N villages, which are numbered from 1 to N, and原创 2015-08-11 19:07:00 · 357 阅读 · 0 评论 -
poj 1789 Truck History 【prim & kruskal】
Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 21527 Accepted: 8374 Description Advanced Cargo Movement, Ltd. uses trucks of different types.原创 2015-08-11 19:02:40 · 432 阅读 · 0 评论 -
最小生成树之 prim & kruskal
最小生成树: 给定一个带权的 n 个结点的无向连通图,选取一个包含原图中的所有 n 个结点,并且保持图连通的,所有边的权值和最小。 求最小生成树的算法: a:Kruskal 算法 图的存贮结构采用边集数组,该方法是按边进行连通的,类似一个开始为空的边集,每次选出不在集合中的权重最小的边,判断是否构成回路,若无,将该边加入到边集中,权值相等的边在数组中排列次序可以是原创 2015-10-25 11:29:15 · 510 阅读 · 0 评论