Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03869026n
Noun Concept
Categories: All articles needing additional references, Graph algorithms, Search algorithms
EN
depth-first search  Depth First Search  Applications of depth-first search  Back edge  depth-first
EN
Depth-first search is an algorithm for traversing or searching tree or graph data structures. Wikipedia
Definitions
Relations
Sources
EN
Depth-first search is an algorithm for traversing or searching tree or graph data structures. Wikipedia
An algorithm for traversing or searching tree or graph data structures Wikipedia Disambiguation
Search algorithm Wikidata
Any graph search algorithm that considers outgoing edges of a vertex before any neighbors of the vertex, that is, outgoing edges of the vertex's predecessor in the search. OmegaWiki
An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking. Wiktionary
Algorithm where one starts at the root and explores as far as possible down before going up. Wiktionary (translation)
IS A
graph traversal
uninformed search algorithm
USES
graph
Wikipedia
EN
depth-first search
Wikidata
EN
depth-first search
Wiktionary
EN
depth-first search
OmegaWiki
EN
depth-first search
Wikipedia Redirections
EN
Applications of depth-first search, Back edge, depth-first, Depth-First Search, depth-first traversal, Depth first search, Depth First Search, DFS algorithm, Forward edge
Wikidata Alias
EN
depth-first traversal, DFS

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License