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 阅读(5553) 评论(0) 推荐(0) 编辑