In a directed graph, for any node v, the number of edges, which have v as their initial node, is called the out degree of the node v.
Outdegree: Number of edges having the node v as root node is the outdegree of the node v.
In a directed graph, for any node v, the number of edges, which have v as their initial node, is called the out degree of the node v.
Outdegree: Number of edges having the node v as root node is the outdegree of the node v.