Nodes = 2500000
>>V = 2500000 E= 19999999
Allocate graph: V=2500000 E=19999999 flag = 1
Total time: 8.85  Section time: 8.85  (Generated a random graph)
Generated graph: G->V = 2500000  G->E = 19999984
Total time: 8.88  Section time: 0.03  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 28.78  Section time: 19.90  (First Kruskal)
Total time: 28.80  Section time: 0.02  (Resetting tree struct)
Total time: 46.30  Section time: 17.50  (Second Kruskal)
Nodes: 2500000  Edges: 2500000
MST weight = 185149459.000000
Total time: 46.33  Section time: 0.03  (Printing tree)