We know that a tree has either 1 or 2 centroids. I can find one centroid using simple dfs.
But, if a tree has 2 centroids, Is there a way to efficiently find the other one?
In case you don't know about centroids of a tree. See here
# | User | Rating |
---|---|---|
1 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
3 | Dominater069 | 160 |
5 | atcoder_official | 158 |
6 | adamant | 155 |
7 | Um_nik | 152 |
8 | djm03178 | 151 |
8 | luogu_official | 151 |
10 | awoo | 148 |
How to find both the centroids of a tree?
We know that a tree has either 1 or 2 centroids. I can find one centroid using simple dfs.
But, if a tree has 2 centroids, Is there a way to efficiently find the other one?
In case you don't know about centroids of a tree. See here
Name |
---|