Assuming a graph $G$ with a precomputed minimum spanning tree, how

efficiently can we update this tree when introducing a new vertex along

with its incident edges to G$?$