TheAlgorithms-C/df/d3b/binary__search_8c_ae1a3968e7947464bee7714f6d43b7002_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.1 (20220911.1526)
 -->
<!-- Title: test Pages: 1 -->
<svg width="154pt" height="82pt"
 viewBox="0.00 0.00 154.00 82.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 78)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test implementations.">
<polygon fill="#999999" stroke="#666666" points="33,-37 0,-37 0,-18 33,-18 33,-37"/>
<text text-anchor="middle" x="16.5" y="-25" 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="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582" target="_top" xlink:title="Recursive implementation.">
<polygon fill="white" stroke="#666666" points="146,-56 69,-56 69,-37 146,-37 146,-56"/>
<text text-anchor="middle" x="107.5" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch1</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="M33,-30.81C40.4,-32.39 49.68,-34.37 59.14,-36.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="58.47,-39.83 68.98,-38.49 59.93,-32.98 58.47,-39.83"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032" target="_top" xlink:title="Iterative implementation.">
<polygon fill="white" stroke="#666666" points="146,-19 69,-19 69,0 146,0 146,-19"/>
<text text-anchor="middle" x="107.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M33,-24.36C40.4,-22.87 49.68,-20.99 59.14,-19.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="59.87,-22.5 68.98,-17.09 58.49,-15.64 59.87,-22.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M93.47,-56.08C86.65,-64.73 91.33,-74 107.5,-74 117.36,-74 122.94,-70.56 124.26,-65.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="127.58,-64.78 121.53,-56.08 120.83,-66.65 127.58,-64.78"/>
</g>
</g>
</svg>