CodeCookbook

Graph

UndirectedBFS/DFS

Vertices connected by edges. Traverse with BFS (level-by-level) or DFS (depth-first). Right-click any node for quick actions.

Nodes
4
Edges
3
Start
A
start
current
queued/stacked
visited
traversed edge