Definition: The number of edges going out of a vertex in a directed graph.
See also in-degree, sink, degree.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue Feb 12 10:57:43 2019.
Cite this as:
Paul E. Black, "out-degree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/outdegree.html