Add solution for UVA 10397 Connect The Campus
using Kruskal Algorithm to build minimum spanning tree

1.sorting the edges by the distance (the shorter edge will be tried
first)
2.picking each edge by order and trying to "unite" each node as the same
group