Nodes = 625000
>>V = 625000 E= 4999999
Allocate graph: V=625000 E=4999999 flag = 1
Total time: 1.94  Section time: 1.94  (Generated a random graph)
Generated graph: G->V = 625000  G->E = 4999992
Total time: 1.94  Section time: 0.00  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 6.62  Section time: 4.68  (First Kruskal)
Total time: 6.62  Section time: 0.00  (Resetting tree struct)
Total time: 10.77  Section time: 4.15  (Second Kruskal)
Nodes: 625000  Edges: 625000
MST weight = 46229646.000000
Total time: 10.78  Section time: 0.01  (Printing tree)