Balise : Éditeur de wikicode 2017 |
Balise : Éditeur de wikicode 2017 |
(Une version intermédiaire par le même utilisateur non affichée) |
Ligne 1 : |
Ligne 1 : |
| | #REDIRECTION[[Algorithme de parcours en profondeur ]] |
|
| |
|
| == en construction ==
| | [[Catégorie:ENGLISH]] |
| [[Catégorie:Vocabulary]] | |
| [[Catégorie:Intelligence artificielle]]
| |
| [[Catégorie:UNSW]]
| |
|
| |
|
|
| |
| == 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.
| |
|
| |
|
| |
|
| |
| <small>
| |
|
| |
|
| [http://www.cse.unsw.edu.au/~billw/aidict.html Source : UNWS AI dictionary ] | | [http://www.cse.unsw.edu.au/~billw/aidict.html Source : UNWS AI dictionary ] |
Dernière version du 10 juin 2020 à 21:43