Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsGraph search algorithms

Depth-first search

Usage

Report a typo

What is the depth-first search procedure used for?

Select one option from the list

To find the shortest paths between all pairs of nodes.

To find a maximal matching.

To traverse graphs.

Only to build a minimum spanning tree.

Create a free account to access the full topic