##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
All paths pass through some centroid
Use centroid decomposition when you need to process all paths in a tree efficiently. The depth ensures each node participates in only centroid computations.
How do you recognize centroid problems? Look for keywords: count paths, path queries, or tree distances with constraints. If simpler techniques like tree DP fail due to complexity, centroid decomposition often works.
