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

Depth-first search for directed graphs

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

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).

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

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

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

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

Depth First Graph Algorithm

utilities for primitive JavaScript types

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

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

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

a topological cyclic sorting algorithm based on depth-first search (dfs)