Nodes = 5000000
>>V = 5000000 E= 19999999
Allocate graph: V=5000000 E=19999999 flag = 1
Total time: 9.15  Section time: 9.15  (Generated a random graph)
Generated graph: G->V = 5000000  G->E = 19999992
Total time: 9.20  Section time: 0.05  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 31.55  Section time: 22.35  (First Kruskal)
Total time: 31.57  Section time: 0.02  (Resetting tree struct)
Total time: 51.62  Section time: 20.05  (Second Kruskal)
Nodes: 5000000  Edges: 4999849
MST weight = 722195156.000000
Total time: 51.69  Section time: 0.07  (Printing tree)