TheAlgorithms-C/df/d3b/binary__search_8c_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg

59 lines
2.7 KiB
XML
Raw Normal View History

<?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 2.49.3 (20211023.0002)
-->
<!-- Title: test Pages: 1 -->
<svg width="156pt" height="84pt"
viewBox="0.00 0.00 156.00 84.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 80)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 152,-80 152,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test implementations.">
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 33,-38.5 33,-19.5 0,-19.5"/>
<text text-anchor="middle" x="16.5" y="-26.5" 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="black" points="69,-38.5 69,-57.5 148,-57.5 148,-38.5 69,-38.5"/>
<text text-anchor="middle" x="108.5" y="-45.5" 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="midnightblue" d="M33.18,-32.31C40.43,-33.84 49.47,-35.75 58.73,-37.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.29,-41.19 68.79,-39.83 59.73,-34.34 58.29,-41.19"/>
</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="black" points="69,-0.5 69,-19.5 148,-19.5 148,-0.5 69,-0.5"/>
<text text-anchor="middle" x="108.5" y="-7.5" 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="midnightblue" d="M33.18,-25.69C40.43,-24.16 49.47,-22.25 58.73,-20.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="59.73,-23.66 68.79,-18.17 58.29,-16.81 59.73,-23.66"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M94.32,-57.76C87.42,-66.57 92.15,-76 108.5,-76 118.72,-76 124.4,-72.31 125.54,-67.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="128.88,-66.35 122.68,-57.76 122.16,-68.34 128.88,-66.35"/>
</g>
</g>
</svg>