In this mission you'll have to make the Minimum spanning tree (Wikipedia) .
You are given a list of coordinates of vertices. Each coordinate is a tuple of x (integer) and y (integer).
You have to return a list (or an iterable) of lines that connect all vertices. The total length of lines should be the minimum. Each line is a tuple of two integers. These integers represent the index of list of input.
- The output of tests has a unique combination of lines.