(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 E. Black.
Entry modified Fri Dec 17 12:04:14 2004.
HTML page formatted Wed Oct 26 09:47:32 2005.
Cite this as:
Paul E. Black, "flow", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/flow.html
