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 7.0.1 (20221109.1506)
|
|
-->
|
|
<!-- Title: greedy_approach/prim.c Pages: 1 -->
|
|
<svg width="270pt" height="82pt"
|
|
viewBox="0.00 0.00 269.50 82.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 78)">
|
|
<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="183.5,-74 62.5,-74 62.5,-55 183.5,-55 183.5,-74"/>
|
|
<text text-anchor="middle" x="123" y="-62" 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="46,-19 0,-19 0,0 46,0 46,-19"/>
|
|
<text text-anchor="middle" x="23" y="-7" 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="M106.04,-54.51C90.64,-46.35 67.69,-34.19 49.81,-24.71"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="51.53,-21.66 41.05,-20.07 48.25,-27.84 51.53,-21.66"/>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="node3" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_node3"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="113.5,-19 64.5,-19 64.5,0 113.5,0 113.5,-19"/>
|
|
<text text-anchor="middle" x="89" y="-7" 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="M117.39,-54.75C112.88,-47.73 106.41,-37.64 100.79,-28.87"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="103.9,-27.24 95.55,-20.72 98.01,-31.02 103.9,-27.24"/>
|
|
</g>
|
|
<!-- Node4 -->
|
|
<g id="node4" class="node">
|
|
<title>Node4</title>
|
|
<g id="a_node4"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="184,-19 132,-19 132,0 184,0 184,-19"/>
|
|
<text text-anchor="middle" x="158" y="-7" 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="M128.78,-54.75C133.41,-47.73 140.07,-37.64 145.87,-28.87"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.67,-30.98 151.26,-20.71 142.83,-27.12 148.67,-30.98"/>
|
|
</g>
|
|
<!-- Node5 -->
|
|
<g id="node5" class="node">
|
|
<title>Node5</title>
|
|
<g id="a_node5"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="261.5,-19 202.5,-19 202.5,0 261.5,0 261.5,-19"/>
|
|
<text text-anchor="middle" x="232" y="-7" 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="M141.49,-54.51C158.5,-46.24 183.99,-33.84 203.59,-24.31"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="204.96,-27.54 212.42,-20.02 201.9,-21.25 204.96,-27.54"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|