Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsGraph search algorithms

Breadth-first search

The basic idea

Report a typo

What is the basic idea of the BFS traversal procedure?

Select one option from the list

Traverse recursively all nodes until the already visited node is reached.

Traverse nodes in the order of increasing distance from the start node.

Traverse nodes in the order of decreasing distance from the start node.

Traverse nodes until already the visited node is reached.

Create a free account to access the full topic