Let G(V,E) be a directed graph, with source s∈V , sink t∈V , and nonnegative edge capacities {ce}. Provide a polynomial-time algorithm to decide whether G has a unique minimum s - t cut (i.e., an s - t cut of capacity strictly less than that of all other s - t cuts).