003 - Do you think the min cut capacity of G would change...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Posted on 25 March 2009 10:00 > Hi Prof. Lam, > Can I apply the Ford-Fulkerson Algorithm when the source is not in-degree 0 and the > sink is not out-degree 0? as the assumption is that no edge enters the source s and no > edge leaves the sink t. > Thanks Let G be a flow network. Suppose G contains an edge from a vertex v to the source s.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the Bío-Bío.

Ask a homework question - tutors are online