The depth is standard to maintain during a depth-first search.

Let be the depth of the resulting depth-first search tree.

One such example is the depth-first search of graphs.

Note: Using a stack instead of a queue would turn this algorithm into a depth-first search.

The idea is to run a depth-first search while maintaining the following information:

This is not possible with a traditional depth-first search, which does not produce intermediate results.

Algorithms that use depth-first search as a building block include:

The variable is the depth-first search node number counter.

An alternative algorithm for topological sorting is based on depth-first search.

Use depth-first search to determine whether A is reachable in the space bound from the starting configuration.

Eclat is a depth-first search algorithm using set intersection.

The algorithm performs a depth-first search over an implicit tree of possible execution paths.

Essentially, this algorithm is a variant of depth-first search.

Maze generation may use a randomized depth-first search.

Typically, these programs employ strategies resembling depth-first search, which means that they do not keep track of all the positions analyzed so far.

This algorithm is a randomized version of the depth-first search algorithm.

Perform a depth-first search of the graph.

It is also possible to use the depth-first search to linearly order the vertices of the original graph (or tree).

Alternatively, a similar procedure may be used with breadth-first search in place of depth-first search.

See depth-first search for more information.

A preordering is a list of the vertices in the order that they were first visited by the depth-first search algorithm.

Primogeniture - the firstborn child inherits all titles, in depth-first search descent.

Small modifications and added depth-first search step produce canonical labeling of all graphs in linear average time.

Backward chaining systems usually employ a depth-first search strategy, e.g. Prolog.

The depth-first search algorithm of maze generation is frequently implemented using backtracking: