Go backward to ExampleGo up to TopGo forward to Example |

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

The

indeg _{G}(x) := |{yinV: <y,x> inE}|whereV=G_{0},E=G_{1}.

The

outdeg _{G}(x) := |{yinV: <x,y> inE}|whereV=G_{0},E=G_{1}.

deg _{G}(x) := indeg_{G}(x) + outdeg_{G}(x).

Author: Wolfgang Schreiner

Last Modification: January 26, 2000