Definition: The number of edges coming into a vertex in a directed graph.
See also out-degree, source, degree.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 3 December 2007.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "in-degree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 3 December 2007. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/indegree.html