breadth-first
Layer before depth
Breadth-first describes a method of searching or traversing a structure by exploring all options at one level before moving deeper.
In computing, a breadth-first search examines all nodes at the current depth before proceeding to the next layer: The algorithm uses breadth-first traversal to find the shortest path.
Contrasts with depth-first, which follows each branch to its end before backtracking.
Act of seeking
- traversalAct of moving through
- queueOrdered waiting line
- graphVisual data display
- treeWoody perennial plant
algorithm · exploration · node · adjacent · visited · iteration · frontier · neighbor
Following ordered procedures
- methodicalOrganized and deliberate
- horizontalParallel to the horizon
- comprehensiveIncluding all elements
- overviewBroad general summary
survey · shallow · wide · scanning · exhaustive · thorough · coverage · incremental
search
Act of seeking
tree · algorithm · exploration · node · adjacent · visited · iteration · frontier · neighbor · layer
systematic
Following ordered procedures
- methodicalOrganized and deliberate
- horizontalParallel to the horizon
- comprehensiveIncluding all elements
overview · survey · shallow · wide · scanning · exhaustive · thorough · coverage · incremental · layered