导出了无向无标号超图和标号超目的计数级数，解决了无向超图的同构和计数问题。
Then the counting series are derived for undirected unlabeled and labeled hypergraphs, thus the isomorphism and counting problems of undirected hypergraphs are solved.
给定一个无向图，编写函数找出所有的最小高度树，并返回其根标号的列表。
Given such a graph, write a function to find all the MHTs and return a list of their root labels.
应用推荐