Depth-first search for directed graphs

iterative deepening depth-first search (IDDFS) for JavaScript

Dependency ordering with depth first search

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

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.

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

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

Identify price fractals using Depth-First Search with Fibonacci Numbers

utilities for primitive JavaScript types

Traversal functions for graphology.

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

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

Test utilities for Nuxt

Three graph search algorithms: 1. Breadth-first-search `bfs` 2. Depth-first search `dfs` 3. Dijkstras algorithm `dijkstra`

Low footprint ECMAScript source code parser

Recursive matching plugin for Regex+

A a collection of languages stemmers and stopwords for Lunr Javascript library

Get the list of files installed in a package in node_modules, including bundled dependencies

JMESPath implementation in javascript