NIST

supersink

(definition)

Definition: A vertex of a directed graph which is reachable from all other vertices.

See also supersource, sink, flow network.

Note: Usually added to convert a graph with multiple sinks into a graph with a single sink.

Author: JM


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 19 April 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Jason McCabe, "supersink", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/supersink.html