Breadth-first deep object filter

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

Simple breadth-first early terminating Levenshtein distance auto correcter for small sets of possible resulting strings.

A breadth-first search path finder.

Breadth-first search for directed graphs

Breadth-first search traversal of an acorn-generated AST.

A small library that does a breadth-first walk of the file system, and emits (customizable) events on the way.

Flexible functional async breadth first search

Breadth First Graph Algorithm

A 3D Matrix Maze Algorithm that uses breadth first search

Breadth-first search a tree

Breadth-first search (BFS) using promise (Bluebird)

breadth-first and deep-first recursive searches for LevelGraph

Breadth-first GraphQL executor

Visitor DOM crawler, supporting breadth-first & in-order traversal.

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

Allows you to do a breadth-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

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

Crawl the web breadth-first from a seed url, statefully