gives the list of vertex in-degrees for all vertices in the graph g.
- The vertex in-degree for a vertex v is the number of incoming directed edges to v.
- For an undirected graph g, an edge is taken to be both an in-edge and an out-edge.
Basic Examples (2)
Find the in-degree for each vertex:
Find the in-degree for a specified vertex:
Properties & Relations (10)
Introduced in 2010
Updated in 2015