Represent that network of wires as a directed graph. Find the biggest tree spanned within the graph. This will be the wire that, should you ever have to replac

Represent that network of wires as a directed graph. Find the biggest tree spanned within the graph. This will be the wire that, should you ever have to replace it, will have you cancel all your other plans for some foreseeable time…