DFS
Stack-based graph exploration
DFS stands for depth-first search, an algorithm that explores a tree or graph by going as deep as possible along each branch before backtracking.
It's fundamental in computer science for traversing data structures, solving mazes, and detecting cycles.
DFS contrasts with breadth-first search (BFS), which explores all neighbors at the current depth before moving deeper.
Point where edges converge
- edgeBoundary or sharpness
- nodeConnection point in networks
- directedGave guidance or orders
- undirectedLacking aim or guidance
acyclic · connected · path · cycle · tree · forest · root · leaf
Items piled vertically
- backtrackReverse one's position
- pushForce something away
- popFizzy drink, regionally
- LIFOReverse-order processing method
depth · termination · unwinding · overflow
Reversing to find alternatives
- traversalAct of moving through
- preorderBuy before availability
- maze-solvingFinding routes through complex paths
- reachabilityState of being contactable
Open-source cluster framework
- storageSpace for keeping goods
- clusterGathered group nearby
- replicationAct of duplicating precisely
- fault-toleranceAbility to withstand malfunctions
block · partition · scalability · throughput
vertex
Point where edges converge
undirected · acyclic · connected · path · cycle · tree · forest · root · leaf · neighbor
stack
Items piled vertically
LIFO · depth · termination · unwinding · overflow
backtracking
Reversing to find alternatives
- traversalAct of moving through
- preorderBuy before availability
- maze-solvingFinding routes through complex paths
Hadoop
Open-source cluster framework
- storageSpace for keeping goods
- clusterGathered group nearby
- replicationAct of duplicating precisely
fault-tolerance · block · partition · scalability · throughput
airport
Aviation passenger facility
liquor · perfume · allowance · declaration · departure · arrival · terminal · tourist
Layer-by-layer graph exploration