mirror of
https://github.com/TheAlgorithms/C
synced 2024-12-15 16:02:38 +03:00
8 lines
516 B
Plaintext
8 lines
516 B
Plaintext
|
<map id="greedy_approach/prim.c" name="greedy_approach/prim.c">
|
||
|
|
<area shape="rect" id="node1" title="Prim's algorithm implementation in C to find the MST of a weighted, connected graph." alt="" coords="87,5,252,32"/>
|
||
|
|
<area shape="rect" id="node2" title=" " alt="" coords="5,80,67,107"/>
|
||
|
|
<area shape="rect" id="node3" title=" " alt="" coords="91,80,157,107"/>
|
||
|
|
<area shape="rect" id="node4" title=" " alt="" coords="181,80,251,107"/>
|
||
|
|
<area shape="rect" id="node5" title=" " alt="" coords="275,80,354,107"/>
|
||
|
|
</map>
|