Implement graph algorithm: Kruskal's (for adjacency list based graph)

[handlessdude]

The result must be a new graph with corresponding base presenting the minimum spanning forest of a given weighted undirected graph

[OKleg]

take it