I have a homework about graph and minimum spanning tree
Suppose for a given graph G1, we have computed a minimum spanning tree T1. Now ,a new edge to G1 is added.We call this new graph with the added edge G2. Describe an algorithm to compute the minimum spanning tree T2 OF G2 efficiently by jut adjusting T1.