Nodes = 2500000
>>V = 2500000 E= 4999999
Allocate graph: V=2500000 E=4999999 flag = 1
Total time: 2.26  Section time: 2.26  (Generated a random graph)
Generated graph: G->V = 2500000  G->E = 4999996
Total time: 2.28  Section time: 0.02  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 8.79  Section time: 6.51  (First Kruskal)
Total time: 8.80  Section time: 0.01  (Resetting tree struct)
Total time: 14.71  Section time: 5.91  (Second Kruskal)
Nodes: 2500000  Edges: 2491621
MST weight = 683417140.000000
Total time: 14.75  Section time: 0.04  (Printing tree)