EasyRememberGraphsMultiple Choice
What is the in-degree of a node in a directed graph?
Remember — Tests recall of fundamental facts and definitions.
Answer Options
ANumber of outgoing edges
BNumber of incoming edges
CTotal edges incident to node
DNumber of nodes reachable from it
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 33+ more Graphs questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Graphs topic (Algorithms).
More Graphs Questions
What is the time complexity of BFS on a graph with V vertices and E edges?
EasyWhat is the difference between a directed and undirected graph?
EasyWhat property of a graph must hold for topological sort to be possible?
EasyWhat does an empty result from Kahn's topological sort indicate?
Medium-EasyTime complexity of Dijkstra's algorithm with a binary min-heap?
Medium-Easy