Allocate graph: V=2500000 E=10000000 flag = 1
Total time: 24.69  Section time: 24.69  (Reading graph from file)
Generated graph: G->V = 2500000  G->E = 8816692
Total time: 24.71  Section time: 0.02  (Making adjacency lists for the graph)
Running Kruskal... 
Total time: 37.29  Section time: 12.58  (First Kruskal)
Total time: 37.31  Section time: 0.02  (Resetting tree struct)
Total time: 49.39  Section time: 12.08  (Second Kruskal)
Nodes: 2500000  Edges: 2499999
MST weight = 505951503989.000000
Total time: 49.42  Section time: 0.03  (Printing tree)