When encountering cycles in a graph, BFS _______ revisits already visited nodes.

  • Always
  • Never
  • Occasionally
  • Sometimes
When encountering cycles in a graph, BFS never revisits already visited nodes. BFS uses a queue to explore nodes, and once a node is visited, it is marked as such. Since BFS explores nodes level by level, it does not revisit nodes, ensuring that cycles do not lead to infinite loops.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *