Depth-first search for directed graphs

Reduce any JSON value by traversing depth first and visiting each node

Node.js file-system helpers: JSON and string read/write, existence checks and deterministic depth-first traversal.

Basic depth-first traversal function

Depth first traversal for recursive, asynchronous JavaScript functions.

Walk or map over objects in a depth-first preorder or postorder manner.

Webpack cylic dependency checker. Does a depth-first traversal of webpack's stats.json output

Declarative depth-first tree traversal with pre-order and post-order hooks.

iterative deepening depth-first search (IDDFS) for JavaScript

Dependency ordering with depth first search

This method does a depth first removal of "empty" values ( [], {}, '') from collections (arrays & objects).

Recursively walks the input in a depth-first search manner and transforms value as needed.

Depth First Graph Algorithm

utilities for primitive JavaScript types

A package to generate mazes using the depth first or hunt and kill algorithm. Mazes can be generated with seed values for reproducibility

iterate tree structure using Depth-first search(DFS) and Breadth-first search(BFS) algorithms for traversing or searching

Allows you to do a depth-first-search through DOM elements.

Traverse file system either breadth-first or depth-first.

For generic graph search: depth-first, breadth-first, ...

Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.