Definition: A vertex of a directed graph with no outgoing edges. More formally, a vertex with with out-degree 0.
See also source, supersink, flow network, critical path problem, multi-commodity flow.
Note: Conceptually, a final destination of whatever is flowing through the graph. In UML, a consumer of data in a design.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.
Cite this as:
Paul E. Black, "sink", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/sink.html