Constructs a Minimum Spanning Tree greedily by growing a single connected component and selecting the cheapest incident edge at each step.