Directed Degrees

For Directed Graphs, you split degree into two types:

$1.$ Out-Degree: Number of edges leaving the node.

$2.$ In-Degree: Number of edges entering the node.

If node $u$ has edges going to $3$ other nodes, its out-degree is $3$. If $5$ edges point to $u$, its in-degree is $5$. These can differ. In the Town Judge problem, the judge has in-degree $N-1$ (everyone trusts them) and out-degree $0$ (they trust nobody). This distinction is key for directed graph problems.