The Algorithm of Heavy Path Decomposition Based on Segment Tree
Download as PDF
Jinpeng Xu, Weixing Zhang
The time complexity or space complexity of the problem between any two nodes on the classic tree is high, and it is not suitable for the situation where modification and query coexist. The solution in this paper is to discuss a new algorithm- Heavy Path Decomposition, which has good time complexity and wide applicability.
Heavy Path Decomposition, Segment Tree, data structure, algorithm