Description
Graph data structure with path finding and traversing algorithms
Keywords
- graph
- dijkstra
- path
- finding
- find path
- path finder
- shortest
- shortest path
- dfs
- depth first search
- bfs
- bredth first search
Publisher
Description
Data oriented tree structure that unleashes the power of callbacks to create, search and traverse the tree.
Keywords
- node
- graph
- tree
- binary
- data-tree
- data
- binary-tree
- search-tree
- BFS
- DFS
- import tree
- export tree
- search
- BST
- View more
Publisher
Description
A library of data structures
Keywords
- js-datastructures
- es6 data structures
- javascript data structures
- data structures
- data structures javascript
- data structures js
- stack
- es6 stack
- queue
- es6 queue
- priority queue
- priorityqueue
- trees
- binary trees
- View more
Publisher
Description
Breadth-first search (BFS) using promise (Bluebird)
Keywords
Publisher
Description
General purpose BFS implementation.
Keywords
Publisher
Description
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.
Keywords
Publisher
Description
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).
Keywords
Publisher
Description
Library to simplify JSON, replacing circular and repeated structures by the path leading to the first time this structure happens (in breadth-first search).
