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 3.0.0 (20220226.1711)
 -->
<!-- Title: prim Pages: 1 -->
<svg width="135pt" height="28pt"
 viewBox="0.00 0.00 135.00 28.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 24)">
<title>prim</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 131,-24 131,4 -4,4"/>
<!-- 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="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 35,-19.5 35,-0.5 0,-0.5"/>
<text text-anchor="middle" x="17.5" y="-7.5" 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="black" points="71,-0.5 71,-19.5 127,-19.5 127,-0.5 71,-0.5"/>
<text text-anchor="middle" x="99" y="-7.5" 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="midnightblue" d="M35.36,-10C42.76,-10 51.77,-10 60.63,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="60.84,-13.5 70.84,-10 60.84,-6.5 60.84,-13.5"/>
</g>
</g>
</svg>