Kruskal's algorithm for finding an MST (Minimal Spanning Tree) from a simple, non-directed, weighted graph