Max00358/2A_Graphs_PowerGrid

Using Kruskal's algorithm, merge sort and union find path compression technique is applied to find a Minimum Spanning Tree (MST) of the graph

C++