- An algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph. ← Wikipedia
- Related terms: Breadth-first search · Root node · Knowledge Graph · Open Graph Protocol
- Previous term: Deprecation trial
- Next term: Deque
- Random term: ART (webglossary.info/random 🎲)