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.2 (20230410.1723)
 -->
<!-- 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.17,-52.99 142.71,-52.97 171.96,-51.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="172.01,-54.9 181.79,-50.82 171.6,-47.92 172.01,-54.9"/>
</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.17,-4.01 142.71,-3.8 171.96,-5.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.62,-8.61 181.79,-5.62 171.98,-1.62 171.62,-8.61"/>
</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.37,-28.5 54.11,-28.5 62.94,-28.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.66,-32 72.66,-28.5 62.66,-25 62.66,-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.1C155.05,-35.32 163.47,-36.63 171.81,-37.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.25,-41.55 181.67,-39.64 172.33,-34.63 171.25,-41.55"/>
</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.59C155.14,-21.29 163.66,-19.88 172.09,-18.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="172.37,-21.83 181.67,-16.74 171.23,-14.92 172.37,-21.83"/>
</g>
</g>
</svg>