Distinct Subtrees 这个问题用什么算法可以解决呢

Problem Description
Given an unrooted tree with n nodes, the subtree is defined as a connected component of the given tree. Two subtrees are considered the same if there exists a map from nodes of one tree to another so that the edges of both trees are corresponding the same pair of nodes after mapping.
Your task is to find out how many distinct subtrees for a given unrooted tree.

Input
The input consists of multiple test cases. The first line of input contains an integer denoting the number of test cases.
For each test case, the first line contains one integer n denoting the number of nodes of the given tree. (1 <= n <= 15)
Then n-1 lines follow, each line contains two integers denoting an edge of the tree (x, y).

Output
For each test case, output the number of distinct subtrees for the given tree.

Sample Input
2
3
1 2
1 3
9
9 4
4 3
1 3
7 4
1 6
5 7
2 4
6 8

Sample Output
Case #1: 3
Case #2: 21

查看全部
shunfurh
编程介的小学生
2018/11/28 08:10
  • 地图
  • lines
  • 点赞
  • 收藏
  • 回答
    私信
满意答案
查看全部

1个回复