NIST

st-digraph

(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


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, "st-digraph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/stdigraph.html