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 5.0.1 (20220820.1526)
 -->
<!-- Title: main Pages: 1 -->
<svg width="337pt" height="212pt"
 viewBox="0.00 0.00 337.00 212.00" 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)">
<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="38,-111 0,-111 0,-92 38,-92 38,-111"/>
<text text-anchor="middle" x="19" y="-99" 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="107,-111 74,-111 74,-92 107,-92 107,-111"/>
<text text-anchor="middle" x="90.5" y="-99" 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="M38.26,-101.5C46.07,-101.5 55.31,-101.5 63.79,-101.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="63.95,-105 73.95,-101.5 63.95,-98 63.95,-105"/>
</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="228.5,-204 172.5,-204 172.5,-185 228.5,-185 228.5,-204"/>
<text text-anchor="middle" x="200.5" y="-192" 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="M95.54,-111.07C102.74,-126.99 119.29,-158.89 143,-176.5 148.78,-180.79 155.61,-184.08 162.49,-186.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="161.9,-190.08 172.49,-189.75 164.01,-183.4 161.9,-190.08"/>
</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="251,-167 150,-167 150,-148 251,-148 251,-167"/>
<text text-anchor="middle" x="200.5" y="-155" 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="M102.25,-111.08C112.22,-119.55 127.76,-131.72 143,-139.5 146.51,-141.29 150.23,-142.95 154.03,-144.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.93,-147.8 163.53,-147.99 155.36,-141.24 152.93,-147.8"/>
</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="258,-130 143,-130 143,-111 258,-111 258,-130"/>
<text text-anchor="middle" x="200.5" y="-118" 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="M107.44,-104.3C115.17,-105.66 125.03,-107.4 135.4,-109.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135,-112.71 145.46,-110.99 136.21,-105.81 135,-112.71"/>
</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="247.5,-93 153.5,-93 153.5,-74 247.5,-74 247.5,-93"/>
<text text-anchor="middle" x="200.5" y="-81" 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="M107.44,-98.84C117.07,-97.24 129.99,-95.09 143.1,-92.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.82,-96.33 153.11,-91.23 142.67,-89.42 143.82,-96.33"/>
</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="253,-56 148,-56 148,-37 253,-37 253,-56"/>
<text text-anchor="middle" x="200.5" y="-44" 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="M103.16,-91.89C113.22,-83.96 128.39,-72.87 143,-65.5 147.28,-63.34 151.86,-61.34 156.49,-59.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.82,-62.75 165.99,-56.01 155.4,-56.19 157.82,-62.75"/>
</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="255.5,-19 145.5,-19 145.5,0 255.5,0 255.5,-19"/>
<text text-anchor="middle" x="200.5" y="-7" 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="M95.76,-91.98C103.16,-76.46 119.87,-45.74 143,-28.5 145.49,-26.64 148.18,-24.96 150.98,-23.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.65,-26.52 160.2,-19.09 149.66,-20.19 152.65,-26.52"/>
</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="329,-93 294,-93 294,-74 329,-74 329,-93"/>
<text text-anchor="middle" x="311.5" y="-81" 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="M247.73,-83.5C260,-83.5 272.84,-83.5 283.69,-83.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="283.78,-87 293.78,-83.5 283.78,-80 283.78,-87"/>
</g>
</g>
</svg>