TheAlgorithms-C/df/d27/alaw_8c_a840bf13d2e4d75d38fb7bf3a655152f5_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.2 (20230410.1723)
 -->
<!-- Title: test Pages: 1 -->
<svg width="196pt" height="64pt"
 viewBox="0.00 0.00 196.00 64.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 60)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="33,-37 0,-37 0,-18 33,-18 33,-37"/>
<text text-anchor="middle" x="16.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/d27/alaw_8c.html#a093ac72124e3c2268d1150676e63175d" target="_top" xlink:title="8bit alaw to 16bit pcm">
<polygon fill="white" stroke="#666666" points="117,-56 69,-56 69,-37 117,-37 117,-56"/>
<text text-anchor="middle" x="93" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">decode</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="M33.3,-31.53C40.51,-33.37 49.34,-35.62 57.94,-37.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.03,-41.45 67.58,-40.53 58.76,-34.66 57.03,-41.45"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../df/d27/alaw_8c.html#a751d8e2c1975706e4d876316518c54c4" target="_top" xlink:title="16bit pcm to 8bit alaw">
<polygon fill="white" stroke="#666666" points="117,-19 69,-19 69,0 117,0 117,-19"/>
<text text-anchor="middle" x="93" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">encode</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M33.3,-23.68C40.51,-21.94 49.34,-19.81 57.94,-17.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="58.68,-20.91 67.58,-15.16 57.04,-14.1 58.68,-20.91"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../da/d4a/bisection__method_8c.html#a858396a5abdb7865e71cf803fdcb37ae" target="_top" xlink:title="Function to check if two input values have the same sign (the property of being positive or negative)">
<polygon fill="white" stroke="#666666" points="188,-37 153,-37 153,-18 188,-18 188,-37"/>
<text text-anchor="middle" x="170.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">sign</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M117.47,-40.59C125.33,-38.62 134.16,-36.39 142.27,-34.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.91,-37.55 151.75,-31.72 141.2,-30.76 142.91,-37.55"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M117.47,-15.1C125.33,-16.97 134.16,-19.07 142.27,-21.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="141.21,-24.59 151.75,-23.51 142.83,-17.78 141.21,-24.59"/>
</g>
</g>
</svg>