in-degree
RU: полустепень захода
The number of edges pointing into a vertex of a directed graph. In dependency terms it counts the vertex's unmet prerequisites; a vertex with in-degree 0 has nothing blocking it.
RU: полустепень захода
The number of edges pointing into a vertex of a directed graph. In dependency terms it counts the vertex's unmet prerequisites; a vertex with in-degree 0 has nothing blocking it.