TheAlgorithms-C/de/d1c/prim_8c__incl.map

8 lines
481 B
Plaintext
Raw Normal View History

<map id="greedy_approach/prim.c" name="greedy_approach/prim.c">
<area shape="rect" id="node1" title="Prim&#39;s algorithm implementation in C to find the MST of a weighted, connected graph." coords="89,5,250,31"/>
<area shape="rect" id="node2" title=" " coords="5,79,67,104"/>
<area shape="rect" id="node3" title=" " coords="91,79,157,104"/>
<area shape="rect" id="node4" title=" " coords="181,79,251,104"/>
<area shape="rect" id="node5" title=" " coords="275,79,354,104"/>
</map>