Depth-first search for directed graphs

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

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

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

iterative deepening depth-first search (IDDFS) for JavaScript

Dependency ordering with depth first search

Depth First Graph Algorithm

Weighted dependency sorter, based on a depth-first topological sort

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

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

Perform a depth first walk of a poset expressed as an adjacency list.

utilities for primitive JavaScript types

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

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

Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro

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

Spavn UI - Vue 3 component library with depth-first design