Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Breadth-first search

Theory

Reconstructing the algorithm

Report a typo

Sort the list below in the order that reconstructs the BFS procedure.

Put the items in the correct order
Consider all unvisited neighbours of the nodes visited at the previous step.
Repeat the previous steps until all the nodes are visited.
Choose one node of a graph as initial. Mark it as visited. Set its distance to 00.
Mark all such nodes as visited and set their distances to d+1d+1, where dd is the distance to the nodes visited at the previous step.
___

Create a free account to access the full topic