Editing Flow network (section)

=== Flow decomposition ===
Flow decomposition<ref>{{Cite book |last=Ahuja |first=Ravindra K. |title=Network flows: theory, algorithms and applications |last2=Magnanti |first2=Thomas L. |last3=Orlin |first3=James B. |date=1993 |publisher=Prentice Hall |isbn=978-0-13-617549-0 |location=Englewood Cliffs (N. J.)}}</ref> is a process of breaking down a given flow into a collection of path flows and cycle flows. Every flow through a network can be decomposed into one or more paths and corresponding quantities, such that each edge in the flow equals the sum of all quantities of paths that pass through it. Flow decomposition is a powerful tool in optimization problems to maximize or minimize specific flow parameters.