Nodes = 2500000
>>V = 2500000 E= 9999999
Allocate graph: V=2500000 E=9999999 flag = 1
Total time: 4.47  Section time: 4.47  (Generated a random graph)
Generated graph: G->V = 2500000  G->E = 9999992
Total time: 4.49  Section time: 0.02  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 15.39  Section time: 10.90  (First Kruskal)
Total time: 15.40  Section time: 0.01  (Resetting tree struct)
Total time: 25.63  Section time: 10.23  (Second Kruskal)
Nodes: 2500000  Edges: 2499923
MST weight = 361144240.000000
Total time: 25.67  Section time: 0.04  (Printing tree)