(definition)
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 E. Black.
Entry modified Fri Dec 17 12:04:45 2004.
HTML page formatted Wed Oct 26 09:47:37 2005.
Cite this as:
"in-degree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/indegree.html
