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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 19 April 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Jason McCabe, "supersink", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/supersink.html