Skip to main content

Deno 2.2 is here with built-in OpenTelemetry, Lint plugins, node:sqlite, and more 🎉️

Search npm for packages to use with Deno

Millions of packages that you already know npm are just a few keystrokes away.
Add them to your projects with a simple command that will already feel familar.

data-structure-typed
Standard data structure
data structure structures data structure datastructure data-structure data structures datastructures data-structures in data structures in data structure binary depth breadth
magnamet
Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.
data structure molestiae data structure non data structures amet binary sunt consequuntur ea ducimus autem quas
usingbytes-dsa
usingbytes-dsa is comprehensive JavaScript library for common data structures and algorithms. This library is designed to be both educational and practical, providing implementations of fundamental data structures and algorithms that can be used in a vari
data-structures algorithms javascript list tree SinglylinkedList DoublyLinkedList OrderedSinglyLinkedList OrderedDoublyLinkedList CircularSinglyLinkedList CircularDoublyLinkedList BinarySearchTree AVLTree RedBlackTree
jkstra
Small JavaScript graph routing library
graph routing pathfinding Dijkstra
@quory/core
Quickly extract relationships from any database
database schema relationships postgres mysql ERD entity-relationship-diagram Dijkstra graph
graph-alg
A Node.js module to manipulate Graph
graph Dijkstra DFS BFS Breadth First Search
dijkstra-floydwarshall-graph
Dijkstra & Floyd Warshall implementation for weighted directed and undirected graphs with iteration logging.
Dijkstra Floyd-Warshall Graphs Algorithm Weighted Undirected Directed Logs Logging Shortest Cheapest Path Route Explanation
pq2
Priority queue w/ decrease key operation, good for Dijkstra's algorithm
heap priority queue priority queue data structure Dijkstra decrease key
hanoi_solver
tower of Hanoi game solver
tower of hanoi tour de Hanoi algorithm graph shortest path algorithme Dijkstra plus court chemin
bounded-queue
Bounded batch queue, where items are produced and consumed based on user specified functions
queue bounded buffer producer consumer promise async Dijkstra semaphore synchronization mutex
@vila91/graph
Directed and Undirected graph implementation based on the following node structure
graph directed undirected Dijkstra