Let G = (V, E) be a loop-free weighted connected undirected graph. For n ∈ Z+, let [e1, e2, . . . , en] be a set of edges (from E) that includes no cycle in G. Modify Kruskal's algorithm in order to obtain a spanning tree of G that is minimal among all the spanning trees of G that include the edges e1, e2, . . . , en.