Minimum Spanning Tree

Statement

Find the minimum spanning tree (MST)MST of a connected, undirected graph with weighted edges.

Example

Consider the following graph:

The minimum spanning tree of the above graph is:

Sample input

Input will be a graph of the form:

v = 5
e = [ [ 1, 2, 1 ],
      [ 1, 3, 1 ],
      [ 2, 3, 2 ],
      [ 2, 4, 3 ],
      [ 3, 5, 3 ],
      [ 4, 5, 2 ] ]

where $v$ is the number of edges, and $e$ is the set of weighted edges. Each edge is coded as follows: $[source, destination, weight]$ ...