poj 1679 The Unique MST (次小生成树算法)
摘要：
The Unique MSTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 16309Accepted: 5652DescriptionGiven 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 阅读全文
posted @ 2013-03-22 17:50 shijianupc 阅读(189) 评论(0) 推荐(0)
浙公网安备 33010602011771号