catflap.org Online Dictionary Query |
6 definitions found
From The Free On-line Dictionary of Computing (27 SEP 03) : [ 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)
From English Wiktionary: All languages (2023-07-27) : [ dictinfo.com:wikt-en-ALL-2023-07-27 ]
depth-first search
n.
(lb en graph theory) An algorithm for traverse a tree or graph where
one starts at the root and explores as far as possible along each branch
before backtracking.
From English Wiktionary: English language only (2023-07-27) : [ dictinfo.com:wikt-en-en-2023-07-27 ]
depth-first search
n.
(lb en graph theory) An algorithm for traverse a tree or graph where
one starts at the root and explores as far as possible along each branch
before backtracking.
From English Wiktionary: Western, Greek, and Slavonic languages only (2023-07-27) : [ dictinfo.com:wikt-en-Western_Greek_Slavonic-2023-07-27 ]
depth-first search
n.
(lb en graph theory) An algorithm for traverse a tree or graph where
one starts at the root and explores as far as possible along each branch
before backtracking.
From English Wiktionary: Western languages only (2023-07-27) : [ dictinfo.com:wikt-en-Western-2023-07-27 ]
depth-first search
n.
(lb en graph theory) An algorithm for traverse a tree or graph where
one starts at the root and explores as far as possible along each branch
before backtracking.
From English-suomi FreeDict+WikDict dictionary ver. 2023.05.29 : [ freedict:eng-fin ]
depth-first search /dˈɛpθ fˈɜːst sˈɜːtʃ/
syvyyshaku
algorithm where one starts at the root and explores as far as possible down before going up
Questions or comments about this site? Contact dictionary@catflap.org
Access Stats