DFS Traversal
TraversalEasyVisualize depth-first graph traversals recursively tracing parent paths.
Alt+Shift+W
Configuration Panel
Complexity Mappings
Time ComplexityO(V + E)
Space ComplexityO(V) recursion call stack depth
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Depth-First Search (DFS) is a traversal algorithm that visits vertices by going as deep as possible along each branch before backtracking.
Algorithm Mechanism
Implemented recursively using the system call stack (or iteratively using an explicit Stack). Visits start node, marks it visited, and recursively calls DFS on all unvisited neighbors.
Source: CP-Algorithms reference guide