Define Indegree Of A Graph?

1.	Define Indegree Of A Graph?
Answer» In a directed graph, for any NODE V, the NUMBER of edges which have v as their terminal node is CALLED the indegree of the node v. In a directed graph, for any node v, the number of edges which have v as their terminal node is called the indegree of the node v.

Answer»

In a directed graph, for any NODE V, the NUMBER of edges which have v as their terminal node is CALLED the indegree of the node v.

In a directed graph, for any node v, the number of edges which have v as their terminal node is called the indegree of the node v.

Discussion