previous up next
Go backward to Example
Go up to Top
Go forward to Example
RISC-Linz logo

Degree

Definition: In a directed graph, the indegree of x is the number of edges whose terminal node is x:

indegG(x) := |{y in V: <y, x> in E}|
   where V=G0, E=G1.
The outdegree of x is the number of edges whose initial node is x:
outdegG(x) := |{y in V: <x, y> in E}|
   where V=G0, E=G1.
The total degree of x is the sum of its indegree and its outdegree:
degG(x) := indegG(x) + outdegG(x).

Author: Wolfgang Schreiner
Last Modification: January 26, 2000

previous up next