mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
82 lines
3.4 KiB
XML
82 lines
3.4 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 8.0.5 (20230430.1635)
|
|
-->
|
|
<!-- Title: greedy_approach/prim.c Pages: 1 -->
|
|
<svg width="266pt" height="83pt"
|
|
viewBox="0.00 0.00 266.00 82.50" 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 78.5)">
|
|
<title>greedy_approach/prim.c</title>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="Prim's algorithm implementation in C to find the MST of a weighted, connected graph.">
|
|
<polygon fill="#999999" stroke="#666666" points="181.75,-74.5 61.5,-74.5 61.5,-55.25 181.75,-55.25 181.75,-74.5"/>
|
|
<text text-anchor="middle" x="121.62" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_approach/prim.c</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="node2" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_node2"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
|
|
<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<path fill="none" stroke="#63b8ff" d="M104.83,-54.84C89.47,-46.58 66.51,-34.23 48.75,-24.68"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.97,-21.36 40.5,-19.7 47.65,-27.52 50.97,-21.36"/>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="node3" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_node3"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="111.75,-19.25 63.5,-19.25 63.5,0 111.75,0 111.75,-19.25"/>
|
|
<text text-anchor="middle" x="87.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string.h</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node3 -->
|
|
<g id="edge2" class="edge">
|
|
<title>Node1->Node3</title>
|
|
<path fill="none" stroke="#63b8ff" d="M116.01,-55.08C111.46,-47.96 104.9,-37.68 99.23,-28.8"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.69,-27.15 93.36,-20.61 95.79,-30.92 101.69,-27.15"/>
|
|
</g>
|
|
<!-- Node4 -->
|
|
<g id="node4" class="node">
|
|
<title>Node4</title>
|
|
<g id="a_node4"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="181.25,-19.25 130,-19.25 130,0 181.25,0 181.25,-19.25"/>
|
|
<text text-anchor="middle" x="155.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">assert.h</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node4 -->
|
|
<g id="edge3" class="edge">
|
|
<title>Node1->Node4</title>
|
|
<path fill="none" stroke="#63b8ff" d="M127.24,-55.08C131.79,-47.96 138.35,-37.68 144.02,-28.8"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.46,-30.92 149.89,-20.61 141.56,-27.15 147.46,-30.92"/>
|
|
</g>
|
|
<!-- Node5 -->
|
|
<g id="node5" class="node">
|
|
<title>Node5</title>
|
|
<g id="a_node5"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="258,-19.25 199.25,-19.25 199.25,0 258,0 258,-19.25"/>
|
|
<text text-anchor="middle" x="228.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">inttypes.h</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node5 -->
|
|
<g id="edge4" class="edge">
|
|
<title>Node1->Node5</title>
|
|
<path fill="none" stroke="#63b8ff" d="M139.78,-54.84C156.45,-46.54 181.43,-34.11 200.66,-24.54"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.99,-27.29 209.38,-19.7 198.87,-21.02 201.99,-27.29"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|