I was trying to solve problems in max flow algorithms. And I came across this MIT Lecture Quiz.
(a) In any maximum flow, and for all vertices v and w, either the amount of flow from v to w (f(v, w)) or the amount of flow from w to v (f(w, v)) is 0.
(b) Consider a directed graph G = (V, E). There always exists a maximum flow of G such that, for all vertices v and w, either the amount flow on vw or the amount of flow on wv is 0.
These two problems look one and the same. And both are based on the trick of 'Flow conservation on any vertex'. The main properties of both problems are the same. except that
first problem ---> any flow (all flow)
second problem --> a flow (at least one flow)
So this made the difference
problem 1 -> False (because any flow on subtraction and add to incoming and out going we can make it non zero. So the statement 'ALL FLOWS' makes this statement false)
problem 2 -> True (because any flow on subtraction and add to incoming and out going we can make it non zero, so whatever be the flow, we can make manipulations such that one is zero and other is non zero. so there is 'A FLOW' with this property. this 'A FLOW' makes this statement true.
Am I right in my understanding of the key difference in both the questions, thought both look almost the same ?