May 2017
Intermediate to advanced
340 pages
8h 16m
English
The total count of incoming edges to a particular vertex is known as the indegree of that vertex, and the total number of outgoing edges from a particular vertex is known as the outdegree of that vertex. If we consider the directed edges of the following diagram, we can say that vertex A has an indegree of 0 and an outdegree of 1, vertex B has an indegree of 2 and an outdegree 1, vertex C has an indegree 1 and an outdegree of 1, vertex D has an indegree of 1 and an outdegree of 1, vertex E has an indegree of 1 and an outdegree of 2, and lastly, vertex F has an indegree of 1 and an outdegree of 0.
Read now
Unlock full access