Suppose that a Graph G has a minimum spanning tree already computed.

a) Suppose that a Graph G has a minimum spanning tree already computed. How quickly can
the minimum spanning tree be updated if a new vertex and incident edges are added to G?

Leave a Reply