For Directed Graphs, you split degree into two types:
Out-Degree: Number of edges leaving the node.
In-Degree: Number of edges entering the node.
If node has edges going to other nodes, its out-degree is . If edges point to , its in-degree is . These can differ. In the Town Judge problem, the judge has in-degree (everyone trusts them) and out-degree (they trust nobody). This distinction is key for directed graph problems.