question archive For an undirected, connected graph G = (V, E) with weights w(e) > 0 for each edge e ∈E, there is a set of edges T which define the MST of G

Subject:Computer SciencePrice:9.82 Bought3

For an undirected, connected graph G = (V, E) with weights w(e) > 0 for each edge e ∈E, there is

a set of edges T which define the MST of G. Unfortunately one of the edges e∗= (u, v) which is in

the MST is deleted from both the graph G and the set of edges T (no other edges change).

Given G −e∗and the updated set T −e∗, define an algorithm to build a MST for the new graph.

Note: G is connected, and G −e∗is also connected. Your algorithm should be correct and faster in

asymptotic Big O(·) notation than building a MST from scratch (so using Prim's or Kruskal's will

receive little credit).

Purchased 3 times