← Questions
Fewest edge moves to connect a graph
0
I was asked this
No reports yet. Sign in to say where you were asked it.
An undirected graph has n nodes and a list of edges. One move detaches an existing edge and reattaches it between any two distinct nodes. Return the fewest moves needed to make the graph connected, or report that it is impossible.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding