# Interval scheduling by minimum spanning tree

This is a homework and I'd like your feedback on whether I'm on the right track. Thank you.

Problem:
There's a project to build a railroad to connect $n$ cities. The railroad that connects any two cities can be done concurrently (so each track $i$ will complete in $t_i$ time from now). The cities and the roads that connect them are given as a weighted, undirected and connected graph with weights being the distances between the cities. Find the fastest schedule to build the railroad that connect all cities and indicate the earliest time when this railroad can be completed

Solution:
I use a slightly modified version of Kruskal's MST algorithm. In particular, starting with a graph with all nodes and no edges, I add the edges one by one in order of increasing weights. The last edge that make all nodes connected is the earliest time of completion; and the resulted tree is the desired schedule.

-