2013年8月8日
poj 1679 The Unique MST(唯一的最小生成树)
摘要： http://poj.org/problem?id=1679The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:17726Accepted:6150DescriptionGiven 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 t 阅读全文
posted @ 2013-08-08 16:57 crazy_apple 阅读(390) 评论(0) 推荐(0) 编辑