迷人苗条

文章
6
资源
0
加入时间
2年10月21天

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 is a subgrap...