Build a graph and explore breadth-first and depth-first traversal. Follow visited nodes and edges to understand how BFS and DFS explore a graph.
Step 0 / 0
800 ms
Choose a start node.
Select algorithm, start/end nodes (if applicable), and run.
Build a graph and explore breadth-first and depth-first traversal. Follow visited nodes and edges to understand how BFS and DFS explore a graph.
Choose a start node.
Select algorithm, start/end nodes (if applicable), and run.