Nodes = 1250000
>>V = 1250000 E= 4999999
Allocate graph: V=1250000 E=4999999 flag = 1
Total time: 2.13  Section time: 2.13  (Generated a random graph)
Generated graph: G->V = 1250000  G->E = 4999992
Total time: 2.14  Section time: 0.01  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 7.47  Section time: 5.33  (First Kruskal)
Total time: 7.48  Section time: 0.01  (Resetting tree struct)
Total time: 12.27  Section time: 4.79  (Second Kruskal)
Nodes: 1250000  Edges: 1249952
MST weight = 180584115.000000
Total time: 12.29  Section time: 0.02  (Printing tree)