Nodes = 5000000
>>V = 5000000 E= 9999999
Allocate graph: V=5000000 E=9999999 flag = 1
Total time: 4.64  Section time: 4.64  (Generated a random graph)
Generated graph: G->V = 5000000  G->E = 9999996
Total time: 4.69  Section time: 0.05  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 18.15  Section time: 13.46  (First Kruskal)
Total time: 18.18  Section time: 0.03  (Resetting tree struct)
Total time: 30.41  Section time: 12.23  (Second Kruskal)
Nodes: 5000000  Edges: 4982866
MST weight = 1366944808.000000
Total time: 30.48  Section time: 0.07  (Printing tree)