In honor of Donald Knuth's lecture series on trees, this week's episode of Algorithms Live! will cover trees. More information can be found here: http://algorithms-live.blogspot.com/2016/12/episode-1-trees-and-diameters.html
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
In honor of Donald Knuth's lecture series on trees, this week's episode of Algorithms Live! will cover trees. More information can be found here: http://algorithms-live.blogspot.com/2016/12/episode-1-trees-and-diameters.html
Name |
---|
Humble request: Please do Episode 2 on Centroid Decomposition.
Episode 2 will feature our first guest and is being planned. I will cover centroid decomposition in the future though. :) I will cover finding centroids this week and many of the prerequisites for centroid decomposition.
How to find remoteness of all nodes of a tree in one DFS ?
Yes. You can modify your DFS to also keep track of the longest path coming in through the parent. Then you just have one extra path to stitch to a subtree path.
great work
Great work! A very good initiative. Keep it up...