(definition)
Definition: A measure of the maximum weight along paths in a weighted, directed graph.
See also flow network, maximum-flow problem.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon May 11 15:07:57 2026.
Cite this as:
Paul E. Black, "flow", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: /HTML/flow.html