(definition)
Definition: The number of edges going out of a vertex in a directed graph.
See also in-degree, sink, degree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:06:13 2004.
HTML page formatted Wed Oct 26 09:47:55 2005.
Cite this as:
Paul E. Black, "out-degree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/outdegree.html
