Depth first search
en construction
Définition
xxxxxxx
Français
xxxxxxx
Anglais
depth first search
Depth-first search is best understood with respect to a tree, though it can be applied to graphs in general, provided a starting node is nominated.
A complete depth first search traverses every node of the tree or graph, starting from the root node or starting node, first processing, checking, or inspecting the root/starting node. In future we'll just say it "processes" the node. Next it considers (but does not yet process) the neighbours of the root/starting node. The neighbours should be ordered in some way. Suppose that the first neighbour is called F1. Depth-first search proceeds to search first the subtree or subgraph composed of the neighbours of F1. Suppose that the first of F1's neighbours is F2. Depth-first search proceeds by searching the subtree or subgraph composed of the neighbours of F2. And so on, until the bottom of the tree/graph is reached.
Contributeurs: wiki
