The Unique MST poj 1679(次小生成树)
题目:POJ - 1679 Given 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 ...