Depth-first search

The four types of edges defined by a spanning tree

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.

单词	Depth First Search
释义	Depth First Search 英语百科 Depth-first search Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.
随便看	employment of funds employment of labor employment of profit employment of salvage service employment of the aged employment of the handicapped employment opportunities employment opportunity employment ordinance employment package employment permit employment plan employment planning employment policy employment policy problem employment population employment practice employment preference employment pressure employment problem employment promoting measure employment promotion employment protection Employment Protection Act employment psychology

Depth First Search

Depth-first search