Nodes = 1250000
>>V = 1250000 E= 9999999
Allocate graph: V=1250000 E=9999999 flag = 1
Total time: 4.22  Section time: 4.22  (Generated a random graph)
Generated graph: G->V = 1250000  G->E = 9999992
Total time: 4.24  Section time: 0.02  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 13.85  Section time: 9.61  (First Kruskal)
Total time: 13.86  Section time: 0.01  (Resetting tree struct)
Total time: 22.42  Section time: 8.56  (Second Kruskal)
Nodes: 1250000  Edges: 1250000
MST weight = 92519167.000000
Total time: 22.44  Section time: 0.02  (Printing tree)