TheAlgorithms-C/da/da0/segment__tree_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
 -->
<!-- Title: main Pages: 1 -->
<svg width="335pt" height="212pt"
 viewBox="0.00 0.00 334.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main Function.">
<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test RMQ Testing Segment tree using Range Minimum Queries.">
<polygon fill="white" stroke="#666666" points="105.5,-111.25 73,-111.25 73,-92 105.5,-92 105.5,-111.25"/>
<text text-anchor="middle" x="89.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M37.2,-101.62C44.67,-101.62 53.52,-101.62 61.73,-101.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.71,-105.13 71.71,-101.62 61.71,-98.13 61.71,-105.13"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb" target="_top" xlink:title="Utility for test A function compare for minimum between two integers This function is used as combine...">
<polygon fill="white" stroke="#666666" points="226.5,-204.25 170.75,-204.25 170.75,-185 226.5,-185 226.5,-204.25"/>
<text text-anchor="middle" x="198.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">minimum</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M94.49,-111.71C101.76,-127.78 118.11,-159.18 141.5,-176.62 147.04,-180.76 153.57,-183.97 160.18,-186.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.91,-190.04 169.5,-189.77 161.06,-183.37 158.91,-190.04"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75" target="_top" xlink:title="Builds a Segment tree It is assumed that leaves of tree already contains data.">
<polygon fill="white" stroke="#666666" points="249,-167.25 148.25,-167.25 148.25,-148 249,-148 249,-167.25"/>
<text text-anchor="middle" x="198.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_build</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M101.34,-111.54C111.26,-119.98 126.52,-131.94 141.5,-139.62 144.27,-141.05 147.18,-142.39 150.15,-143.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.81,-147.26 159.4,-147.59 151.32,-140.73 148.81,-147.26"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01" target="_top" xlink:title="Dispose Segment Tree Frees all heap memory accquired by segment tree.">
<polygon fill="white" stroke="#666666" points="255.75,-130.25 141.5,-130.25 141.5,-111 255.75,-111 255.75,-130.25"/>
<text text-anchor="middle" x="198.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_dispose</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M105.63,-104.35C112.54,-105.57 121.22,-107.11 130.47,-108.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.63,-112.32 140.08,-110.62 130.85,-105.43 129.63,-112.32"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../da/da0/segment__tree_8c.html#a3513a2b7c3f1d15aa3d019af1f834cde" target="_top" xlink:title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d...">
<polygon fill="white" stroke="#666666" points="245.25,-93.25 152,-93.25 152,-74 245.25,-74 245.25,-93.25"/>
<text text-anchor="middle" x="198.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_init</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="#63b8ff" d="M105.63,-99.05C115.15,-97.45 128.02,-95.29 141.11,-93.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="141.32,-96.45 150.6,-91.34 140.16,-89.54 141.32,-96.45"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91" target="_top" xlink:title="Query the segment tree This function helps in range query of segment tree This function assumes that ...">
<polygon fill="white" stroke="#666666" points="250.88,-56.25 146.38,-56.25 146.38,-37 250.88,-37 250.88,-56.25"/>
<text text-anchor="middle" x="198.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_query</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node2&#45;&gt;Node8</title>
<path fill="none" stroke="#63b8ff" d="M101.78,-91.67C111.74,-83.48 126.81,-72.05 141.5,-64.62 144.28,-63.22 147.2,-61.89 150.18,-60.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.34,-63.57 159.43,-56.72 148.84,-57.03 151.34,-63.57"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c" target="_top" xlink:title="For point updates This function updates the element at given index and also updates segment tree acco...">
<polygon fill="white" stroke="#666666" points="253.5,-19.25 143.75,-19.25 143.75,0 253.5,0 253.5,-19.25"/>
<text text-anchor="middle" x="198.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_update</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node2&#45;&gt;Node9</title>
<path fill="none" stroke="#63b8ff" d="M94.53,-91.68C101.85,-75.82 118.27,-44.84 141.5,-27.62 142.97,-26.54 144.51,-25.51 146.1,-24.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.34,-27.33 154.65,-19.66 144.15,-21.1 147.34,-27.33"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" target="_top" xlink:title="Continuous loop to send and receive over the socket.">
<polygon fill="white" stroke="#666666" points="326.5,-93.25 291.75,-93.25 291.75,-74 326.5,-74 326.5,-93.25"/>
<text text-anchor="middle" x="309.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">func</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="#63b8ff" d="M245.64,-83.62C257.6,-83.62 270.11,-83.62 280.76,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="280.49,-87.13 290.49,-83.62 280.49,-80.13 280.49,-87.13"/>
</g>
</g>
</svg>