(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Mon Sep 11 09:46:08 2006.
Cite this as:
Jason McCabe, "supersink", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/supersink.html