Given such a graph, write a function to find all the MHTs and return a list of their root labels.
给定一个无向图,编写函数找出所有的最小高度树,并返回其根标号的列表。
Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs).
在所有可能的有根树中,高度最小的称为最小高度树(MHT)。
Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs).
在所有可能的有根树中,高度最小的称为最小高度树(MHT)。
应用推荐