(data structure)
Definition: A directed acyclic graph with two specially marked nodes, the source s and the sink t.
See also flow network.
Note: After P. Bertolazzi, G. Di Battista, and W. Didimo, Quasi-upward planarity, Algorithmica, 32:474-506 (2002).
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Paul E. Black, "st-digraph", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/stdigraph.html