Suggests edges to cut to break every cycle in graph, strongest (largest cycle) first. Returns an empty list for an acyclic graph.