Files
C-Plus-Plus/dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.map
2023-06-16 21:35:33 +00:00

12 lines
1.0 KiB
Plaintext

<map id="greedy_algorithms/boruvkas_minimum_spanning_tree.cpp" name="greedy_algorithms/boruvkas_minimum_spanning_tree.cpp">
<area shape="rect" id="Node000001" title="[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka&#39;s_algorithm) to find the Minimum Spanning ..." alt="" coords="70,5,264,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="136,49,71,88,68,84,133,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="93,94,153,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="158,48,139,82,134,79,154,45"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="177,94,248,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="180,45,200,80,196,82,176,48"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="272,94,329,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="201,44,269,84,266,88,199,49"/>
</map>