Search results

1000+ packages found

A breadth-first search path finder.

published version 5.0.4, 6 months ago0 dependents licensed under $ISC
1,438

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

published version 1.0.2, 2 years ago0 dependents licensed under $MIT
17

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

published version 0.2.0, 8 years ago1 dependents licensed under $MIT
973

Flexible functional async breadth first search

published version 0.1.9, 12 years ago1 dependents licensed under $MIT
53

A 3D Matrix Maze Algorithm that uses breadth first search

published version 3.0.2, 3 years ago0 dependents licensed under $MIT
56

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

published version 2.0.1, 7 years ago0 dependents licensed under $MIT
126

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

published version 0.3.287, 3 years ago5 dependents licensed under $MIT
1,211

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

published version 1.0.4, 9 years ago0 dependents licensed under $MIT
21

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

published version 0.3.33, 6 years ago0 dependents licensed under $MIT
107

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

published version 3.0.0, 3 years ago48 dependents licensed under $ISC
12,117,437

Breadth-first search for js value

published version 1.0.1, 6 years ago1 dependents licensed under $MIT
9

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

published version 2.0.6, 10 years ago0 dependents licensed under $MIT
49

Traversal functions for graphology.

published version 0.3.1, 3 years ago13 dependents licensed under $MIT
971,485

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

published version 1.0.38, 5 months ago0 dependents
27

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

published version 1.0.4, 8 years ago0 dependents licensed under $Apache-2.0
35

Breadth-first deep object filter

published version 2.0.0, 6 years ago8 dependents licensed under $MIT
1,375,200

Breadth-first search a tree

published version 1.1.0, 5 years ago0 dependents licensed under $MIT
5

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

published version 1.0.1, 7 years ago0 dependents licensed under $MIT
7

JMESPath implementation in javascript

published version 0.16.0, 3 years ago300 dependents licensed under $Apache-2.0
37,029,998

Package implements data structures and algorithms for processing various types of graphs

published version 1.0.18, 7 years ago9 dependents licensed under $MIT
298,906