TheAlgorithms-C/d7/d3b/group__hash_ga994ea8b243b6c0fbef734551ec5765dd_cgraph.svg

37 lines
1.6 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 8.0.4 (20230421.1958)
-->
<!-- Title: test_adler32 Pages: 1 -->
<svg width="161pt" height="27pt"
viewBox="0.00 0.00 160.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_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="69.25,-19.25 0,-19.25 0,0 69.25,0 69.25,-19.25"/>
<text text-anchor="middle" x="34.62" y="-5.75" 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="152.75,-19.25 105.25,-19.25 105.25,0 152.75,0 152.75,-19.25"/>
<text text-anchor="middle" x="129" y="-5.75" 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="M69.5,-9.62C77.48,-9.62 85.99,-9.62 93.97,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="93.81,-13.13 103.81,-9.62 93.81,-6.13 93.81,-13.13"/>
</g>
</g>
</svg>