Let G = (V, E) be a directed graph with source s V , sink t V and non-negative edge capacities. Give a polynomial-time algorithm to determine whether G has a unique minimum s-t cut (i.e., an s-t cut whose capacity is strictly less than the capacity of any other s-t cut).