Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Breadth-first search

The right walk with BFS

Report a typo

Given below is a directed graph:

The right walk with BFS

Assume that we apply BFS starting with the node $3$ . What will be the order of visited nodes provided that the neighbors are visited from the smallest to the biggest ones?

Select one option from the list

3 1 2 4

3 4 2 3 1

3 1 4 2

3 1 2 3 4

___

Create a free account to access the full topic