Unformatted text preview: Do you think the min cut capacity of G would change if this edge is deleted? How about the situation with an edge from sink t to a vertex v? If your answers are all NO, then you can delete these edges from the network before you run the max flow algorithm. Let me know whether my reply makes any sense to you. Tak...
View Full Document
- Spring '10
- Graph Theory, Flow network, Maximum flow problem, Network flow, Max Flow Algorithm, Prof. Lam