TheAlgorithms-C/d7/d3b/group__hash_gab87679863646255178427a56dc33e453_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 8.0.4 (20230421.1958)
 -->
<!-- Title: test_sdbm Pages: 1 -->
<svg width="146pt" height="27pt"
 viewBox="0.00 0.00 145.75 27.25" 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 23.25)">
<title>test_sdbm</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test function for sdbm.">
<polygon fill="#999999" stroke="#666666" points="61.75,-19.25 0,-19.25 0,0 61.75,0 61.75,-19.25"/>
<text text-anchor="middle" x="30.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_sdbm</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605" target="_top" xlink:title="SDBM algorithm implementation.">
<polygon fill="white" stroke="#666666" points="137.75,-19.25 97.75,-19.25 97.75,0 137.75,0 137.75,-19.25"/>
<text text-anchor="middle" x="117.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sdbm</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="M62.04,-9.62C69.91,-9.62 78.41,-9.62 86.3,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.28,-13.13 96.28,-9.62 86.28,-6.13 86.28,-13.13"/>
</g>
</g>
</svg>