TheAlgorithms-C/d7/d3b/group__hash_gad451622bbdca271edfa8e0d98ca422f2_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 3.0.0 (20220226.1711)
 -->
<!-- Title: test_crc32 Pages: 1 -->
<svg width="147pt" height="28pt"
 viewBox="0.00 0.00 147.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_crc32</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 143,-24 143,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test function for crc32.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 62,-19.5 62,-0.5 0,-0.5"/>
<text text-anchor="middle" x="31" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">test_crc32</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#ga483e7ee6db1dc09a0f3e683e028ec567" target="_top" xlink:title="32&#45;bit CRC algorithm implementation">
<polygon fill="white" stroke="black" points="98,-0.5 98,-19.5 139,-19.5 139,-0.5 98,-0.5"/>
<text text-anchor="middle" x="118.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">crc32</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="M62.38,-10C70.59,-10 79.47,-10 87.65,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="87.89,-13.5 97.89,-10 87.89,-6.5 87.89,-13.5"/>
</g>
</g>
</svg>