in-degree

The number of edges pointing into a vertex of a directed graph; out-degree counts the edges leaving it.

In more detail

A vertex with in-degree zero has no prerequisites, so Kahn's algorithm starts from those vertices. In an undirected graph, a vertex's degree is simply its number of neighbours.

Related terms

Taught in

References