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 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
1 | maomao90 | 163 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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 |
---|