TheAlgorithms-C/d9/dcc/prim_8c_a0bea087eb586c437cf0a667f794c8853_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 7.0.2 (20221119.0110)
 -->
<!-- Title: prim Pages: 1 -->
<svg width="135pt" height="27pt"
 viewBox="0.00 0.00 135.00 27.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 23)">
<title>prim</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Used to find MST of user&#45;generated adj matrix G.">
<polygon fill="#999999" stroke="#666666" points="35,-19 0,-19 0,0 35,0 35,-19"/>
<text text-anchor="middle" x="17.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">prim</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><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="#666666" points="127,-19 71,-19 71,0 127,0 127,-19"/>
<text text-anchor="middle" x="99" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">minimum</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="M35.36,-9.5C42.38,-9.5 50.84,-9.5 59.25,-9.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="59.02,-13 69.02,-9.5 59.02,-6 59.02,-13"/>
</g>
</g>
</svg>