A breadth-first search path finder.

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

Flexible functional async breadth first search

A 3D Matrix Maze Algorithm that uses breadth first search

Breadth-first search for directed graphs

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

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

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

Breadth-first search a tree

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

Breadth-first search for js value

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

Breadth-first deep object filter

Traversal functions for graphology.

A jQuery extension supporting asynchronous breadth-first-search action. Outputs are used as inputs for further BFS action until a specified condition is met (usually max depth or number of results).

A package to offer a built-in Queue data structure and Breadth First Search (BFS) method for traversing a graph for JavaScript applications.

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

Library to simplify JSON, replacing circular and repeated structures by the path leading to the first time this structure happens (in breadth-first search).

Apply the BFS algorith to get the connection path between two nodes