people who can please write Implementation of Heavy-Light Decomposition(with comments if you can). Couldn't find any good implementation. Thanks!!!
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 144 |
people who can please write Implementation of Heavy-Light Decomposition(with comments if you can). Couldn't find any good implementation. Thanks!!!
Name |
---|
this implementation is a Heavy-Light Decomposition solution of GSS7
http://ideone.com/dPS5N https://sites.google.com/site/indy256/algo/heavy_light
So any links? the first two are deadlinks and the third is too complex. any simple implementation?
There's a really nice and clear code here
Here is my implementation of finding lowest common ancestor using Heavy-Light Decomposition. Enjoy.
Check out this Heavy-Light Decomposition by Anudeep.