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 7.0.2 (20221119.0110)
 -->
<!-- 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.66,-111.33C28.91,-127.33 45.41,-158.98 69,-176.5 74.45,-180.55 80.85,-183.71 87.34,-186.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.17,-189.46 96.76,-189.21 88.32,-182.8 86.17,-189.46"/>
</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.64,-111.42C38.62,-119.86 53.96,-131.82 69,-139.5 71.84,-140.95 74.81,-142.31 77.85,-143.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.33,-146.75 86.92,-147.04 78.82,-140.21 76.33,-146.75"/>
</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.3C40.28,-105.51 48.78,-107 57.82,-108.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.11,-112.02 67.57,-110.31 58.33,-105.13 57.11,-112.02"/>
</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.84C42.78,-97.29 55.23,-95.21 67.94,-93.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.32,-96.58 77.61,-91.48 67.17,-89.67 68.32,-96.58"/>
</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.57,-91.57C39.62,-83.67 54.59,-72.77 69,-65.5 72.53,-63.72 76.26,-62.05 80.05,-60.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.27,-63.78 89.39,-56.96 78.79,-57.23 81.27,-63.78"/>
</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 70.91,-27.07 72.94,-25.75 75.04,-24.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.54,-27.69 83.96,-20.13 73.44,-21.41 76.54,-27.69"/>
</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.5C185.4,-83.5 197.6,-83.5 208.1,-83.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="208.01,-87 218.01,-83.5 208.01,-80 208.01,-87"/>
</g>
</g>
</svg>