Skip to main content
Computer Science

Return to Question

added 18 characters in body
Source Link
Steven
Steven
  • 29.6k
  • 2
  • 28
  • 49

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

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.

Suppose I have a minimum spanning tree $T$ in a graph $G=(V,E)$ with positive edge weights $w$. Provide an algorithm that after adding a new edge $e$ with a unique weight $w(e)$ to $G$, returns true if $T$ will still be an MST.

Source Link
Amir Mor
Amir Mor
  • 3
  • 2

adding an edge, Is T still a MST to the new graph?

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.