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 7.0.4 (20221203.1631)
 -->
<!-- Title: main Pages: 1 -->
<svg width="280pt" height="64pt"
 viewBox="0.00 0.00 280.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>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="38,-38 0,-38 0,-19 38,-19 38,-38"/>
<text text-anchor="middle" x="19" y="-26" 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="272,-56 183,-56 183,-37 272,-37 272,-56"/>
<text text-anchor="middle" x="227.5" y="-44" 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="M38.08,-36.59C48.38,-40.76 61.66,-45.39 74,-47.5 106.03,-52.97 142.39,-52.97 171.57,-51.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.5,-54.99 181.28,-50.91 171.09,-48 171.5,-54.99"/>
</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="272,-19 183,-19 183,0 272,0 272,-19"/>
<text text-anchor="middle" x="227.5" y="-7" 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="M38.08,-20.41C48.38,-16.24 61.66,-11.61 74,-9.5 106.02,-4.03 142.39,-3.8 171.57,-5.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.11,-8.53 181.27,-5.54 171.46,-1.54 171.11,-8.53"/>
</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="147,-38 74,-38 74,-19 147,-19 147,-38"/>
<text text-anchor="middle" x="110.5" y="-26" 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="M38.11,-28.5C45.21,-28.5 53.73,-28.5 62.36,-28.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.15,-32 72.15,-28.5 62.15,-25 62.15,-32"/>
</g>
<!-- Node4&#45;&gt;Node2 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M147.26,-34.1C154.96,-35.3 163.28,-36.6 171.53,-37.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.75,-41.32 181.17,-39.41 171.83,-34.4 170.75,-41.32"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M147.26,-22.59C154.96,-21.32 163.28,-19.95 171.53,-18.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.88,-22.07 181.17,-16.99 170.74,-15.17 171.88,-22.07"/>
</g>
</g>
</svg>