Data Structure (2130702)

BE | Semester-3   Summer-2017 | 05/31/2017

Q5) (a)

Explain outdegree and indegree.

The no of edges which have V as their terminal node is call as indegree of node V.
The no of edges which have V as their initial node is call as outdegree of node V.
Sum of indegree and outdegree of node V is called its Total Degree or Degree of vertex.