| slovo | definícia |
depth-first search
(foldoc) | depth-first search
A graph search algorithm which extends the
current path as far as possible before backtracking to the
last choice point and trying the next alternative path.
Depth-first search may fail to find a solution if it enters a
cycle in the graph. This can be avoided if we never extend a
path to a node which it already contains.
Opposite of breadth first search. See also {iterative
deepening}.
(1995-04-19)
|
| | podobné slovo | definícia |
depth-first search
(foldoc) | depth-first search
A graph search algorithm which extends the
current path as far as possible before backtracking to the
last choice point and trying the next alternative path.
Depth-first search may fail to find a solution if it enters a
cycle in the graph. This can be avoided if we never extend a
path to a node which it already contains.
Opposite of breadth first search. See also {iterative
deepening}.
(1995-04-19)
|
|
Nenašli ste slovo čo ste hľadali ? Doplňte ho do slovníka.
na vytvorenie tejto webstránky bol pužitý dictd server s dátami z sk-spell.sk.cx a z iných voľne dostupných dictd databáz. Ak máte klienta na dictd protokol (napríklad kdict), použite zdroj slovnik.iz.sk a port 2628.
online slovník, sk-spell - slovníkové dáta, IZ Bratislava, Malé Karpaty - turistika, Michal Páleník, správy, údaje o okresoch V4