随笔分类 -  最小生成树

Prim 和 Kruscal 算法
POJ 1679 The Unique MST(次小生成树)
摘要:The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:16984Accepted:5892DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, s 阅读全文

posted @ 2013-06-20 22:15 kuangbin 阅读(5560) 评论(0) 推荐(0) 编辑

POJ 3026 Borg Maze(bfs+最小生成树)
摘要:Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:6634Accepted:2240DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg 阅读全文

posted @ 2013-06-20 20:09 kuangbin 阅读(3140) 评论(1) 推荐(1) 编辑

HDU 4463 Outlets 第37届ACM/ICPC 杭州赛区K题 (裸最小生成树)
摘要:OutletsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18Accepted Submission(s): 11Problem DescriptionIn China, foreign brand commodities are often much more expensive than abroad. The main reason is that we Chinese people tend to think foreign thi 阅读全文

posted @ 2012-11-08 21:00 kuangbin 阅读(2012) 评论(2) 推荐(0) 编辑

ZOJ 3204 Connect them (最小生成树,输出字典序最小的解)
摘要:Connect themTime Limit: 1 Second Memory Limit: 32768 KBYou have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers j and i). The cost of connect. 阅读全文

posted @ 2012-09-27 16:23 kuangbin 阅读(1526) 评论(1) 推荐(0) 编辑

导航

JAVASCRIPT:
点击右上角即可分享
微信分享提示