Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Depth-first search

Theory

Spanning tree

Report a typo

Given below is an undirected graph:

Undirected graph

Assume that we apply DFS for the graph starting with the node aa. Which of the trees below corresponds to the DFS spanning tree provided that neighbors are visited in the alphabetic order?

a:

The spanning tree (option a)

b:

The spanning tree (option b)

c:

The spanning tree (option c)

d:

The spanning tree (option d)

Select one option from the list
___

Create a free account to access the full topic