First version of Union-Find. The subsets are represented by separate entities of custom LinkedList,
which makes it much more tedious to deal with Nodes of the Union-Find data structure, as Union-Find
becomes a set of LinkedLists.
Working Union-Find data structure implementation. Got rid of a LinkedList subset abstraction
Algo2. Task2. Kruskal's minimum spanning tree algorithm. Uses UnionFind data structure.
Algo2. Task2. Datafiles.