Important:The networks package has been deprecated. Use the superseding command GraphTheory[InDegree]instead.

This routine computes the in-degree of a single vertex.

Both undirected and directed edges can coexist but indegree considers only genuine directed edges in computing this value. See vdegree() for the ``total degree'' of the vertex.

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[indegree](...).

$\mathrm{with}\left(\mathrm{networks}\right)\:$

$\mathrm{new}\left(G\right)\:$

$\mathrm{addvertex}\left(1\,2\,3\,4\,G\right)\:$

$\mathrm{addedge}\left(\left[\left\{1\,2\right\}\,\left\{1\,2\right\}\,\left[1\,2\right]\,\left[1\,3\right]\,\left[4\,1\right]\right]\,G\right)\:$

$\mathrm{vdegree}\left(1\,G\right)$

$2$

$\mathrm{indegree}\left(1\,G\right)$

$1$

$\mathrm{outdegree}\left(1\,G\right)$

$2$