breadth-first search
Horizontal graph traversal
Breadth-first search is an algorithm for traversing tree or graph structures by exploring all nodes at the current depth before moving to nodes at the next depth level.
It proceeds outward in layers, like ripples from a stone dropped in water.
The approach guarantees finding the shortest path in unweighted graphs.
Often contrasted with depth-first search, which explores as far as possible along each branch before backtracking.
Ordered waiting line
- traversalAct of moving through
- explorationTraveling through unknown regions
- visitedWent to see someone
- frontierEdge of settlement
discovery · iterative · pathfinding · enumeration · expansion · FIFO · neighbor · reachability
Underground absorbing structure
- nodesPoints of connection
- childrenYoung human beings
- siblingsFellow offspring
- branchingSplitting into separate directions
leaf · subtree · depth · parent · forest · hierarchical · ancestor · descendant
Corner points of shapes
- edgesOuter limits or boundaries
- adjacencyState of being beside
- connectivityState of being linked
- unweightedWithout assigned importance
directed · undirected · bipartite · acyclic · network · sparse · dense · topological
Satellite-based location technology
- maze-solvingFinding routes through complex paths
- peer-to-peerServerless network architecture
- puzzle-solvingFinding answers to challenges
- routingPath selection process
Mind's retention capacity
- scalabilityCapacity for growth
- performanceCarrying out a task
- worst-caseMost unfavorable outcome imaginable
- asymptoticApproaching a limit infinitely
bounded · polynomial · efficient · overhead
queue
Ordered waiting line
- traversalAct of moving through
- explorationTraveling through unknown regions
- visitedWent to see someone
frontier · discovery · iterative · pathfinding · enumeration · expansion · FIFO · neighbor · reachability · completeness
root
Underground absorbing structure
branching · leaf · subtree · depth · parent · forest · hierarchical · ancestor · descendant · layered
vertices
Corner points of shapes
- edgesOuter limits or boundaries
- adjacencyState of being beside
- connectivityState of being linked
unweighted · directed · undirected · bipartite · acyclic · network · sparse · dense · topological · reachable
GPS
Satellite-based location technology
- maze-solvingFinding routes through complex paths
- peer-to-peerServerless network architecture
- puzzle-solvingFinding answers to challenges
memory
Mind's retention capacity
- scalabilityCapacity for growth
- performanceCarrying out a task
- worst-caseMost unfavorable outcome imaginable
asymptotic · bounded · polynomial · efficient · overhead
- pathfindingpathfinding, maze solving, shortest path, DFS
- recursionrecursion, base case, self-reference, infinite recursion, recurrence relation
- text algorithmspattern matching, regex, BOM, grep, regular expressions