Files
C-Plus-Plus/d2/d2c/segment__tree_8cpp__incl.map
2026-09-21 04:13:18 +00:00

12 lines
999 B
Plaintext

<map id="data_structures/segment_tree.cpp" name="data_structures/segment_tree.cpp">
<area shape="rect" id="Node000001" title="A data structure to quickly do operations on ranges: the Segment Tree algorithm implementation." alt="" coords="90,5,256,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,77,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,47,76,88,73,83,137,46"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="100,94,158,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="164,45,145,82,141,78,160,48"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="181,94,256,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="186,44,206,81,201,80,183,49"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="280,94,344,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="208,44,280,86,275,86,207,49"/>
</map>