TheAlgorithms-C/de/d1c/prim_8c__incl.map
2023-04-27 19:43:13 +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="87,5,248,31"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,79,66,105"/>
<area shape="rect" id="node3" title=" " alt="" coords="90,79,154,105"/>
<area shape="rect" id="node4" title=" " alt="" coords="179,79,247,105"/>
<area shape="rect" id="node5" title=" " alt="" coords="271,79,349,105"/>
</map>