finds vertex indegrees in a graph
graph or network
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](...).
Download Help Document