Beginner
Data Structures & Algorithms
Q34 / 100
What is the in-degree of a node in a directed graph?
Correct! Well done.
Incorrect.
The correct answer is C) The number of edges entering the node
C
Correct Answer
The number of edges entering the node
Explanation
In-degree counts edges pointing into a node. Out-degree counts edges going out. Both matter in algorithms like topological sort.
Progress
34/100