Allocate graph: V=2500000 E=20000000 flag = 1
Total time: 42.79  Section time: 42.79  (Reading graph from file)
Generated graph: G->V = 2500000  G->E = 4996750
Total time: 42.81  Section time: 0.02  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 50.29  Section time: 7.48  (First Kruskal)
Total time: 50.30  Section time: 0.01  (Resetting tree struct)
Total time: 56.73  Section time: 6.43  (Second Kruskal)
Nodes: 2500000  Edges: 2500000
MST weight = 668412222002.000000
Total time: 56.77  Section time: 0.04  (Printing tree)