Search results

71 packages found

M
Q
P

The Route Exploration Algorithm is a graph traversal library implemented in TypeScript with BFS in mind

published 1.0.0 3 years ago
M
Q
P

Syntax analysis. Lot of different methods.

published 1.6.4 3 years ago
M
Q
P

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

published 1.0.2 9 years ago
M
Q
P

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.

published 1.0.2 8 years ago
M
Q
P

Just Tree algorithms.

published 1.9.0 3 years ago
M
Q
P

Call a function on each file in a filesystem tree

published 1.0.0 9 years ago
M
Q
P

JavaScript Data Structure

published 0.7.3 6 years ago
M
Q
P

Graphs!

published 1.1.0 7 years ago
M
Q
P

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

published 0.2.0 7 years ago
M
Q
P
M
Q
P

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 1.0.4 7 years ago
M
Q
P
M
Q
P

Breadth-first search for js value

published 1.0.1 5 years ago
M
Q
P

Standard collections in TypeScript / JavaScript

published 1.4.4 3 years ago
M
Q
P

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

published 1.0.1 6 years ago
M
Q
P

A generic DAG visitor for use in JavaScript

published 1.0.2 4 years ago
M
Q
P

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 2.0.6 9 years ago
M
Q
P

A package for implementing pathfinding algorithms for web apps that need some kind of path finding, maze solving. Supports both weighted and unweighted algos.

published 1.0.11 3 years ago
M
Q
P

Use classic algorithms for Graphs.

published 3.0.0 5 years ago
M
Q
P