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 2.49.3 (20211023.0002)
 -->
<!-- Title: test_adler32 Pages: 1 -->
<svg width="166pt" height="28pt"
 viewBox="0.00 0.00 166.00 28.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 24)">
<title>test_adler32</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 162,-24 162,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test function for adler32.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 72,-19.5 72,-0.5 0,-0.5"/>
<text text-anchor="middle" x="36" y="-7.5" 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="black" points="108,-0.5 108,-19.5 158,-19.5 158,-0.5 108,-0.5"/>
<text text-anchor="middle" x="133" y="-7.5" 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="midnightblue" d="M72.1,-10C80.5,-10 89.46,-10 97.82,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="97.99,-13.5 107.99,-10 97.99,-6.5 97.99,-13.5"/>
</g>
</g>
</svg>