Nodes = 10000000
>>V = 10000000 E= 19999999
Allocate graph: V=10000000 E=19999999 flag = 1
Total time: 9.43  Section time: 9.43  (Generated a random graph)
Generated graph: G->V = 10000000  G->E = 19999996
Total time: 9.52  Section time: 0.09  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 37.69  Section time: 28.17  (First Kruskal)
Total time: 37.74  Section time: 0.05  (Resetting tree struct)
Total time: 63.51  Section time: 25.77  (Second Kruskal)
Nodes: 10000000  Edges: 9966272
MST weight = 2733367125.000000
Total time: 63.65  Section time: 0.14  (Printing tree)