In a weighted tree, how to find for some node (u) the distance to another node (v) (answering Q queries effeiciently)? Constraints N <=10^3, Queries <=10^3
Distance Between Nodes in A Tree
In a weighted tree, how to find for some node (u) the distance to another node (v) (answering Q queries effeiciently)? Constraints N <=10^3, Queries <=10^3
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | jhjfbsbfkbjfnfnfjfj | 2020-04-08 09:46:46 | 189 | Initial revision (published) |