Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
In BFS, how many times a node is visited in a directed graph?
Equivalent to indegree of the node
Equivalent of degree of the node
Equivalent of outdegree of the node
Twice
Once
Thrice
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!