TheAlgorithms-C/dc/d47/realtime__stats_8c_aa54c915581fcc495489175a4386d59fd_cgraph.svg

52 lines
2.4 KiB
XML
Raw Normal View History

<?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.1 (20221109.1506)
-->
<!-- Title: test_function Pages: 1 -->
<svg width="206pt" height="64pt"
viewBox="0.00 0.00 206.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_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="73,-37 0,-37 0,-18 73,-18 73,-37"/>
<text text-anchor="middle" x="36.5" y="-25" 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="198,-56 109,-56 109,-37 198,-37 198,-56"/>
<text text-anchor="middle" x="153.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="M73.26,-33.41C80.96,-34.68 89.28,-36.05 97.53,-37.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.74,-40.83 107.17,-39.01 97.88,-33.93 96.74,-40.83"/>
</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="198,-19 109,-19 109,0 198,0 198,-19"/>
<text text-anchor="middle" x="153.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="M73.26,-21.9C80.96,-20.7 89.28,-19.4 97.53,-18.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="97.83,-21.6 107.17,-16.59 96.75,-14.68 97.83,-21.6"/>
</g>
</g>
</svg>