TheAlgorithms-C/da/da0/segment__tree_8c_aa8dca7b867074164d5f45b0f3851269d_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 6.0.2 (20221011.1828)
 -->
<!-- Title: test Pages: 1 -->
<svg width="263pt" height="212pt"
 viewBox="0.00 0.00 263.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>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test RMQ Testing Segment tree using Range Minimum Queries.">
<polygon fill="#999999" stroke="#666666" points="33,-111 0,-111 0,-92 33,-92 33,-111"/>
<text text-anchor="middle" x="16.5" y="-99" font-family="Helvetica,sans-Serif" font-size="10.00">test</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#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="154.5,-204 98.5,-204 98.5,-185 154.5,-185 154.5,-204"/>
<text text-anchor="middle" x="126.5" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">minimum</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="M21.54,-111.07C28.74,-126.99 45.29,-158.89 69,-176.5 74.78,-180.79 81.61,-184.08 88.49,-186.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.9,-190.08 98.49,-189.75 90.01,-183.4 87.9,-190.08"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><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="177,-167 76,-167 76,-148 177,-148 177,-167"/>
<text text-anchor="middle" x="126.5" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_build</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M28.25,-111.08C38.22,-119.55 53.76,-131.72 69,-139.5 72.51,-141.29 76.23,-142.95 80.03,-144.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.93,-147.8 89.53,-147.99 81.36,-141.24 78.93,-147.8"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><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="184,-130 69,-130 69,-111 184,-111 184,-130"/>
<text text-anchor="middle" x="126.5" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_dispose</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M33.44,-104.3C41.17,-105.66 51.03,-107.4 61.4,-109.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61,-112.71 71.46,-110.99 62.21,-105.81 61,-112.71"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><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="173.5,-93 79.5,-93 79.5,-74 173.5,-74 173.5,-93"/>
<text text-anchor="middle" x="126.5" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_init</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M33.44,-98.84C43.07,-97.24 55.99,-95.09 69.1,-92.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.82,-96.33 79.11,-91.23 68.67,-89.42 69.82,-96.33"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><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="179,-56 74,-56 74,-37 179,-37 179,-56"/>
<text text-anchor="middle" x="126.5" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_query</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="#63b8ff" d="M29.16,-91.89C39.22,-83.96 54.39,-72.87 69,-65.5 73.28,-63.34 77.86,-61.34 82.49,-59.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.82,-62.75 91.99,-56.01 81.4,-56.19 83.82,-62.75"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><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="181.5,-19 71.5,-19 71.5,0 181.5,0 181.5,-19"/>
<text text-anchor="middle" x="126.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_update</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="#63b8ff" d="M21.76,-91.98C29.16,-76.46 45.87,-45.74 69,-28.5 71.49,-26.64 74.18,-24.96 76.98,-23.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.65,-26.52 86.2,-19.09 75.66,-20.19 78.65,-26.52"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><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="255,-93 220,-93 220,-74 255,-74 255,-93"/>
<text text-anchor="middle" x="237.5" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">func</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="#63b8ff" d="M173.73,-83.5C186,-83.5 198.84,-83.5 209.69,-83.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.78,-87 219.78,-83.5 209.78,-80 209.78,-87"/>
</g>
</g>
</svg>