TheAlgorithms-C/d7/d3b/group__hash_ga994ea8b243b6c0fbef734551ec5765dd_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_adler32 Pages: 1 -->
<svg width="162pt" height="27pt"
 viewBox="0.00 0.00 162.00 27.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 23)">
<title>test_adler32</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test function for adler32.">
<polygon fill="#999999" stroke="#666666" points="70,-19 0,-19 0,0 70,0 70,-19"/>
<text text-anchor="middle" x="35" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">test_adler32</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#ga506f0227a3b5f9434a503e09a3cb672b" target="_top" xlink:title="32&#45;bit Adler algorithm implementation">
<polygon fill="white" stroke="#666666" points="154,-19 106,-19 106,0 154,0 154,-19"/>
<text text-anchor="middle" x="130" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">adler32</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="M70.1,-9.5C78.49,-9.5 87.45,-9.5 95.79,-9.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="95.93,-13 105.93,-9.5 95.93,-6 95.93,-13"/>
</g>
</g>
</svg>