TheAlgorithms-C/dc/d47/realtime__stats_8c_aa54c915581fcc495489175a4386d59fd_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.5 (20230430.1635)
 -->
<!-- Title: test_function Pages: 1 -->
<svg width="205pt" height="64pt"
 viewBox="0.00 0.00 205.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>test_function</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test the algorithm implementation.">
<polygon fill="#999999" stroke="#666666" points="72.25,-37.25 0,-37.25 0,-18 72.25,-18 72.25,-37.25"/>
<text text-anchor="middle" x="36.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_function</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="197,-56.25 108.25,-56.25 108.25,-37 197,-37 197,-56.25"/>
<text text-anchor="middle" x="152.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="M72.73,-33.53C80.49,-34.82 88.87,-36.21 97.17,-37.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.54,-41.2 106.98,-39.38 97.69,-34.29 96.54,-41.2"/>
</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="197,-19.25 108.25,-19.25 108.25,0 197,0 197,-19.25"/>
<text text-anchor="middle" x="152.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="M72.73,-22.03C80.49,-20.81 88.87,-19.49 97.17,-18.19"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="97.65,-21.5 106.98,-16.49 96.56,-14.58 97.65,-21.5"/>
</g>
</g>
</svg>