TheAlgorithms-C/de/d1c/prim_8c__incl.map
2022-09-08 00:17:03 +00:00

8 lines
516 B
Plaintext

<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." alt="" coords="89,5,250,31"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,79,67,104"/>
<area shape="rect" id="node3" title=" " alt="" coords="91,79,157,104"/>
<area shape="rect" id="node4" title=" " alt="" coords="181,79,251,104"/>
<area shape="rect" id="node5" title=" " alt="" coords="275,79,354,104"/>
</map>