BfS Packages

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

Use classic algorithms for Graphs.

Breadth-first search for js value

JavaScript Data Structure

Graph data structure with path finding and traversing algorithms

Call a function on each file in a filesystem tree

Walk DOM with BFS and DFS traversing algorithms

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

Web SQLite is a wrapper for Sqlite on Wasm that uses the Origin Private File System to persist the sqlite database file.

nv-facutil-json-readonly-visitor ================================ - nv-facutil-json-readonly-visitor - simplified version of nvjson, BUT only support read-only - flatten json - json read-only visitor - bfs - pre-dfs - post-dfs - begin-end-dfs

Standard collections in TypeScript / JavaScript

Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.

Algernon is a JS library for efficiently generating, solving, and rendering mazes.

A package for algorithms

Standard AVL tree

Tree Multiset, AVLTree, BST, Binary Tree. Javascript & Typescript Data Structure.

Tree Multiset, AVLTree, BST, Binary Tree. Javascript & Typescript Data Structure.

Undirected Graph. Javascript & Typescript Data Structure.

Optimal swap path finder for UniswapV2-based AMM DEX model

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