depth-first search
Computing Dictionary

depth-first search definition

algorithm
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)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

00:10

00:09

00:08

00:07

00:06

00:05

00:04

00:03

00:02

00:01

Depth-first search is always a great word to know.
So is interrobang. Does it mean:
a gadget; dingus; thingumbob.
a printed punctuation mark (‽), available only in some typefaces, designed to combine the question mark (?) and the exclamation point (!), indicating a mixture of query and interjection, as after a rhetorical question.
LEARN MORE UNUSUAL WORDS WITH WORD DYNAMO...
Partners:WordBloglinesCitysearchThe Daily BeastAsk AnswersAsk KidsLife123SendoriThesaurus
Dictionary.com, LLC. Copyright © 2012. All rights reserved.
About Privacy Policy Terms of Use API Careers Advertise with Us Contact Us Help
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT