npm

33 packages found

M
Q
P

Description

Create Map trees usefull for property inheritance

Keywords

Publisher

published 1.1.15 months ago
M
Q
P

Description

Small module for graph traversals, supporting DFS and BFS with niceties added for pre- and post-order, including their reverses.

Keywords

Publisher

published 1.0.152 years ago
M
Q
P

Description

Deep iteration of any object or iterable collection.

Keywords

Publisher

published 1.1.03 years ago
M
Q
P

Description

Enhanced and multifunctional tree walker

Keywords

Publisher

published 1.0.3a year ago
M
Q
P

Description

Graph data structure with path finding and traversing algorithms

Keywords

Publisher

published 0.1.96 months ago
M
Q
P

Description

Data oriented tree structure that unleashes the power of callbacks to create, search and traverse the tree.

Keywords

Publisher

published 1.2.44 years ago
M
Q
P

Description

A Node.js module to manipulate Graph

Keywords

Publisher

published 1.0.32 years ago
M
Q
P
M
Q
P

Description

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

Keywords

Publisher

published 1.0.43 years ago
M
Q
P

Description

General purpose BFS implementation.

Keywords

Publisher

published 2.1.72 years ago
M
Q
P

Description

Graphs!

Keywords

Publisher

published 1.1.02 years ago
M
Q
P

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

published 1.0.23 years ago
M
Q
P

Description

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

Keywords

Publisher

published 1.0.12 years ago
M
Q
P

Description

Access subtree elements using keypath, with wildcard ('*') support.

Keywords

Publisher

published 1.0.24 years ago
M
Q
P

Description

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

Keywords

Publisher

published 0.2.03 years ago
M
Q
P

Description

A generic DAG visitor for use in JavaScript

Keywords

Publisher

published 1.0.15 months ago
M
Q
P

Description

Sparse & bitwise adjacency matrices for directed / undirected graphs

Keywords

Publisher

published 0.1.256 days ago
M
Q
P

Description

Use classic algorithms for Graphs.

Keywords

Publisher

published 2.1.06 months ago
M
Q
P

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

published 1.0.42 years ago
M
Q
P

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

Keywords

Publisher

published 2.0.64 years ago