graph/bfs_dfs_utils library

BFS/DFS traversal with hooks (roadmap #532).

Functions

bfs(Adjacency graph, int start, void visit(int node, int depth), {int maxDepth = -1}) → void

BFS from start; calls visit(node, depth) for each node. maxDepth caps depth (-1 = no limit).

dfs(Adjacency graph, int start, void visit(int node, int depth), {int maxDepth = -1}) → void

DFS from start; calls visit(node, depth). maxDepth caps depth (-1 = no limit).