To find broken links in networks we use the cut-set space. Information on which nodes can talk, or not, to which other nodes allows reduction of the problem to that of decoding the cut-set code of a graph. Special classes of such codes are known to have polynomial-time decoding algorithms. We present a simple algorithm to achieve the reduction and apply it in two examples.
Mattson, H. F. Jr, "Fault-Detection in Networks" (1992). Electrical Engineering and Computer Science Technical Reports. 177.