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.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "sink", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: