Minimum Cut Problem Flow network. Abstraction for material flowing through the edges. G =(V,E)=directed graph,no parallel edges. Two distinguished nodes:s source,t=sink. c(e)capacity of edge e. 9 5 10 15 15 4 10 source(s 8 10 sink 6 15 15 10 capacity 30 44 Flow network.  Abstraction for material flowing through the edges.  G = (V, E) = directed graph, no parallel edges.  Two distinguished nodes: s = source, t = sink.  c(e) = capacity of edge e. Minimum Cut Problem s 2 3 4 5 6 7 t 15 5 30 15 10 8 15 9 6 10 10 15 10 4 4 capacity source sink