31.)

Subject: Advanced Computer Algorithms

State whether the following statements are true or false? Give reasons for your answers.

31, (TIF) Suppose that a flow network G = (V, E) violates the assumption that the network contains a path s v t for all vertices v E V. Let u be a vertex for which there is no path s u ~. There must exist a maximum flowfin G such thatf(u, v)- f(v, u) 0 for all vertices v e V, which means it is safe to remove such vertices and their incident edges without changing the maximum flow