Suppose I have a minimum spanning tree T in a graph G(V,E), with positive edge weights w, provide an algorithm:
After adding a new edge e with a unique weight w(e) to G, return true if T will still be an MST.