2013年6月20日

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) 编辑

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

导航

JAVASCRIPT: