Talk:Flow network

From Wikipedia, the free encyclopedia

WikiProject Systems     (Rated B-Class)
Systems science Portal This article is within the scope of WikiProject Systems, which collaborates on articles related to Systems science.
Systems rating:	B Class	High importance	Field: Operations research
Please update this rating as the article progresses, or if the rating is inaccurate. Please also add comments to suggest improvements to the article.

[edit] Explanations

I think these points need more explanations:

See that there can be an edge from u to v in the residual network, even though there is no edge from u to v in the original network.

and

Notice that augmenting path (s,a,b,d,c,t) does not exist in the original network, but you can send flow along it, and still get a legal flow.

I would also suggest a simpler graphs (without the returning negative flows). It's just too complex for somebody who sees this for the first time. Such simpler graph is for example at Max flow. Maybe there could be both versions with explanation that they are equivalent. Jirka6 15:14, 23 February 2007 (UTC)