49 packages found
Deep iteration of any object or iterable collection.
Apply the BFS algorith to get the connection path between two nodes
Data oriented tree structure that unleashes the power of callbacks to create, search and traverse the tree.
- import tree
- export tree
- View more
Small module for graph traversals, supporting DFS and BFS with niceties added for pre- and post-order, including their reverses.
Bucket problem solver
Enhanced and multifunctional tree walker
Deep iteration of any object or iterable collection. (This version revised by @msablanet)
Create Map trees usefull for property inheritance
- data structures
- undirected graph
- directed graph
- weighted graph
- breadth first search
- depth first search
- shortest path
- minimum spanning tree
- View more
Breadth-first search (BFS) using promise (Bluebird)
A Node.js module to manipulate Graph
General purpose BFS implementation.
Access subtree elements using keypath, with wildcard ('*') support.
Simplify JS objects, replacing circular references by the path leading to the parent reference. Useful before a JSON.stringify() or a recursive navigation over the object.
Just Tree algorithms.
Breadth-first search traversal of an acorn-generated AST.
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).
- binary search
- dfs pre order
- dfs post order
- dfs in order