Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Depth-first search

Start DFS

Report a typo

Below is an undirected graph:

Run DFS in an undirected graph

Assume that we apply DFS starting with the node $3$ . In which order will the nodes be visited provided that neighbors are considered from the smallest to the biggest one?

Select one option from the list

3 1 2 4 5

3 4 1 5 2

1 2 3 5 4

3 2 1 5 4

___

Create a free account to access the full topic