Minimum Spanning Tree
=====================

Minimum Spanning Tree (MST) is a subset of the edges of a connected,
edge-weighted undirected graph that connects all the vertices together,
without any cycles and with the minimum possible total edge weight.

Kruskal's Algorithm
-------------------

.. autofunction:: min_span_tree.min_span_tree.minimumCost

Prim's Algorithm
----------------

Coming soon