mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
59 lines
2.7 KiB
XML
59 lines
2.7 KiB
XML
|
<?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 2.49.2 (20211016.1639)
|
||
|
-->
|
||
|
<!-- Title: test Pages: 1 -->
|
||
|
<svg width="206pt" height="46pt"
|
||
|
viewBox="0.00 0.00 206.00 46.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 42)">
|
||
|
<title>test</title>
|
||
|
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 202,-42 202,4 -4,4"/>
|
||
|
<!-- Node1 -->
|
||
|
<g id="node1" class="node">
|
||
|
<title>Node1</title>
|
||
|
<g id="a_node1"><a xlink:title="Self-test implementations.">
|
||
|
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 33,-19.5 33,-0.5 0,-0.5"/>
|
||
|
<text text-anchor="middle" x="16.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||
|
</a>
|
||
|
</g>
|
||
|
</g>
|
||
|
<!-- Node1->Node1 -->
|
||
|
<g id="edge3" class="edge">
|
||
|
<title>Node1->Node1</title>
|
||
|
<path fill="none" stroke="midnightblue" d="M5.71,-19.76C0.46,-28.57 4.06,-38 16.5,-38 24.08,-38 28.38,-34.5 29.39,-29.77"/>
|
||
|
<polygon fill="midnightblue" stroke="midnightblue" points="32.77,-28.82 27.29,-19.76 25.92,-30.26 32.77,-28.82"/>
|
||
|
</g>
|
||
|
<!-- Node2 -->
|
||
|
<g id="node2" class="node">
|
||
|
<title>Node2</title>
|
||
|
<g id="a_node2"><a xlink:href="../../d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853" target="_top" xlink:title="Used to find MST of user-generated adj matrix G.">
|
||
|
<polygon fill="white" stroke="black" points="69,-0.5 69,-19.5 105,-19.5 105,-0.5 69,-0.5"/>
|
||
|
<text text-anchor="middle" x="87" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">prim</text>
|
||
|
</a>
|
||
|
</g>
|
||
|
</g>
|
||
|
<!-- Node1->Node2 -->
|
||
|
<g id="edge1" class="edge">
|
||
|
<title>Node1->Node2</title>
|
||
|
<path fill="none" stroke="midnightblue" d="M33.04,-10C40.56,-10 49.82,-10 58.48,-10"/>
|
||
|
<polygon fill="midnightblue" stroke="midnightblue" points="58.59,-13.5 68.59,-10 58.59,-6.5 58.59,-13.5"/>
|
||
|
</g>
|
||
|
<!-- Node3 -->
|
||
|
<g id="node3" class="node">
|
||
|
<title>Node3</title>
|
||
|
<g id="a_node3"><a xlink:href="../../d9/dcc/prim_8c.html#a72ec66b10f86d67064d34f2b2717fdfc" target="_top" xlink:title="Finds index of minimum element in edge list for an arbitrary vertex.">
|
||
|
<polygon fill="white" stroke="black" points="141,-0.5 141,-19.5 198,-19.5 198,-0.5 141,-0.5"/>
|
||
|
<text text-anchor="middle" x="169.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">minimum</text>
|
||
|
</a>
|
||
|
</g>
|
||
|
</g>
|
||
|
<!-- Node2->Node3 -->
|
||
|
<g id="edge2" class="edge">
|
||
|
<title>Node2->Node3</title>
|
||
|
<path fill="none" stroke="midnightblue" d="M105.07,-10C112.5,-10 121.53,-10 130.42,-10"/>
|
||
|
<polygon fill="midnightblue" stroke="midnightblue" points="130.68,-13.5 140.68,-10 130.68,-6.5 130.68,-13.5"/>
|
||
|
</g>
|
||
|
</g>
|
||
|
</svg>
|