H - The Unique MST（次小生成树）

最新推荐文章于 2021-07-27 19:04:04 发布

香樟依旧

最新推荐文章于 2021-07-27 19:04:04 发布

阅读量246

点赞数

文章标签：最小生成树次小生成树 prim

本文链接：https://blog.csdn.net/y1356998843/article/details/81333228

版权

给定一个连通无向图，判断其最小生成树是否唯一。文章介绍了图的定义，最小生成树的概念，并提供了输入输出样例，说明了如何判断最小生成树的唯一性。解题策略包括计算最小生成树的总成本，并通过比较所有可能的额外边对总成本的影响来确定唯一性。

摘要由CSDN通过智能技术生成

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 subgraph of G, say T = (V', E'), with the following properties:
1. V' = V.
2. T is connected and acyclic.

Definition 2 (Minimum Spanning Tree): Consider an edge-weighted, connected, undirected graph G = (V, E). The minimum spanning tree T = (V, E') of G is the spanning tree that has the smallest total cost. The total cost of T means the sum of the weights on all the edges in E'.

Input

The first line contains a single integer t (1 <= t <= 20), the number of test cases. Each case represents a graph. It begins with a line containing two integers n and m (1 <= n <= 100), the nu