[Python](PAT)1021 Deepest Root（25 分）

最新推荐文章于 2022-06-13 16:03:16 发布

Amos H

最新推荐文章于 2022-06-13 16:03:16 发布

阅读量435

点赞数

分类专栏： Python PAT 文章标签： python PAT 图的遍历

本文链接：https://blog.csdn.net/qq_35499060/article/details/82155944

版权

该博客讨论了如何在给定的无环连接图（树）中找到导致最高树高度的根节点，即最深根。介绍了输入和输出规格，并提供了样例输入和输出。文章通过广度优先搜索来解决此问题，当图的连通分量不为1时，输出错误信息及连通组件数量。Python实现代码也进行了展示。

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

A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤104) which is the number of nodes, and hence the nodes are numbered from 1 to N. Then N−1 lines follow, each describes an edge by given the two adjacent nodes' numbers.

Output Specification:

For each test case, print each of the deepest roots in a line. If such a root is not unique, print them in increasing order of their numbers. In case that the given graph is not a tree, print Error: K components where K is the number of connected components in the graph.