❤
npm
Sign UpSign In

Search results

58 packages found

Sort by: Default
  • Default
  • Most downloaded this week
  • Most downloaded this month
  • Most dependents
  • Recently published

magnamet

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

cordiewill
published version 1.18.1, 10 months ago2 dependents licensed under $MIT
126

@magieno/sqlite-client

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

etiennenoel
published version 3.45.1-build5-with-extension-support, 10 months ago0 dependents licensed under $ISC
102

uniswapv2-path-optimizer

Optimal swap path finder for UniswapV2-based AMM DEX model

swimmie
published version 1.2.2, a year ago0 dependents licensed under $ISC
92

@moyuyc/walk-tree

Enhanced and multifunctional tree walker

moyuyc
published version 1.0.3, 6 years ago1 dependents licensed under $MIT
58

js-data-structs

A library of data structures and algorithms

aveeksaha
published version 2.0.0, 4 years ago1 dependents licensed under $MIT
64

bfs

Find the path of a value in a complex JavaScript object graph/tree

hirokiosame
published version 1.0.0, 4 years ago0 dependents licensed under $MIT
63

js-data-structure

JavaScript Data Structure

almandsky
published version 0.7.3, 6 years ago0 dependents licensed under $MIT
53

algernon-js

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

we-gold
published version 0.3.1, 2 years ago0 dependents licensed under $MIT
66

pathfinding-algorithms

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

samarthya
published version 1.0.11, 3 years ago0 dependents licensed under $ISC
51

@kitmi/algo

Common JavaScript algorithms

rockie
published version 1.1.1, 8 months ago2 dependents licensed under $MIT
48

dom-walker

Walk DOM with BFS and DFS traversing algorithms

k03mad
published version 3.2.0, 7 years ago0 dependents licensed under $MIT
52

async-bfs

Flexible functional async breadth first search

spion
published version 0.1.9, 12 years ago1 dependents licensed under $MIT
45

algo-visual

A package for algorithms

akshaypatel
published version 2.1.4, 9 months ago1 dependents licensed under $MIT
40

@klippersubs/bfs

General purpose BFS implementation.

aliceklipper
published version 2.1.7, 7 years ago0 dependents licensed under $MIT
43

graphs-adt

Graph data structure with path finding and traversing algorithms

ciaranca
published version 0.1.9, 6 years ago0 dependents licensed under $MIT
41

queuejs-bfs

A package to offer a built-in Queue data structure and Breadth First Search (BFS) method for traversing a graph for JavaScript applications.

mcroak
published version 1.0.38, 2 months ago0 dependents
35

gca

Use classic algorithms for Graphs.

amirlib
published version 3.0.0, 5 years ago0 dependents licensed under $MIT
39

fs-walk-breadth-first

Call a function on each file in a filesystem tree

ericlathrop
published version 1.0.0, 10 years ago0 dependents licensed under $MIT
38

bfs-tree-layout

Index computations for balanced binary trees stored in BFS order

mikolalysenko
published version 0.0.4, 12 years ago3 dependents licensed under $MIT
31

@jcirizar/water-jug-solver

Bucket problem solver

jcirizar
published version 1.1.4, 3 years ago0 dependents licensed under $ISC
29