TheAlgorithms-C/dc/d47/realtime__stats_8c_a3c04138a5bfe5d72780bb7e82a18e627_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.4 (20230421.1958)
 -->
<!-- Title: main Pages: 1 -->
<svg width="278pt" height="64pt"
 viewBox="0.00 0.00 278.00 64.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 60.25)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628" target="_top" xlink:title="continuous mean and variance computance using first value as an approximation for the mean.">
<polygon fill="white" stroke="#666666" points="270,-56.25 181.25,-56.25 181.25,-37 270,-37 270,-56.25"/>
<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stats_computer1</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="M37.41,-36.72C47.61,-40.88 60.76,-45.52 73,-47.62 104.86,-53.11 141.05,-53.11 170.08,-51.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.05,-55.06 179.83,-50.98 169.64,-48.07 170.05,-55.06"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96" target="_top" xlink:title="continuous mean and variance computance using Welford&#39;s algorithm (very accurate)">
<polygon fill="white" stroke="#666666" points="270,-19.25 181.25,-19.25 181.25,0 270,0 270,-19.25"/>
<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stats_computer2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M37.41,-20.53C47.61,-16.37 60.76,-11.73 73,-9.62 104.86,-4.14 141.05,-3.91 170.08,-5.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.66,-8.7 179.83,-5.71 170.02,-1.71 169.66,-8.7"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd" target="_top" xlink:title="Test the algorithm implementation.">
<polygon fill="white" stroke="#666666" points="145.25,-38.25 73,-38.25 73,-19 145.25,-19 145.25,-38.25"/>
<text text-anchor="middle" x="109.12" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_function</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="M37.43,-28.62C44.55,-28.62 53.09,-28.62 61.73,-28.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.64,-32.13 71.64,-28.62 61.64,-25.13 61.64,-32.13"/>
</g>
<!-- Node4&#45;&gt;Node2 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M145.73,-34.22C153.49,-35.44 161.87,-36.76 170.17,-38.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.56,-41.67 179.98,-39.76 170.65,-34.75 169.56,-41.67"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M145.73,-22.72C153.49,-21.43 161.87,-20.04 170.17,-18.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.69,-21.96 179.98,-16.87 169.54,-15.05 170.69,-21.96"/>
</g>
</g>
</svg>