Search results

21 packages found

Shortest path functions for graphology.

published version 2.1.0, a year ago21 dependents licensed under $MIT
224,991

A NodeJS implementation of Dijkstra's algorithm

published version 2.5.0, 8 years ago37 dependents licensed under $MIT
127,374

Some JavaScript and TypeScript implementation of a graph data structure. Features: - Insert and remove nodes. - Connect and disconnect nodes. - Algorithms for graph structures.

published version 1.0.1, 4 years ago0 dependents licensed under $ISC
1,461

Complex Network Analysis Tool.

published version 2.1.5, a year ago0 dependents licensed under $Apache-2.0
263

Data structure and graph processing library written in modern JavaScript

published version 1.0.0, 5 years ago1 dependents licensed under $MIT
152

Shortest path strategies in JS

published version 1.1.0, 5 years ago1 dependents licensed under $ISC
112

arrow-utils library binds array and object methods.Complex Array and Object operations are made simple

published version 1.3.1, 2 years ago0 dependents licensed under $ISC
104

Bellman-ford algorithm.

published version 4.0.4, 4 months ago0 dependents licensed under $MIT
58

Dijkstra algorithm optimized with priority queue.

published version 4.0.4, 4 months ago0 dependents licensed under $MIT
85

Documentation app: [raikuxq-algorithms.netlify.app/guide](https://raikuxq-algorithms.netlify.app/guide)

published version 1.2.5, 3 years ago0 dependents licensed under $MIT
59

Simple implementation of basic algorithms.

published version 1.0.8, 9 years ago0 dependents licensed under $Unlicense
37

The algorithm to find the maximum matching of the bipartite graph.

published version 2.0.14, 2 years ago0 dependents licensed under $MIT
40

Graph data structure with path finding and traversing algorithms

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

Dijkstra algorithm (bigint version) optimized with @algorithm.ts/priority-queue.

published version 2.0.14, 2 years ago0 dependents licensed under $MIT
30

Implementation of Floy-Warshall's algorithm for finding shortest paths in a directed weighted graph.

published version 1.0.2, 4 years ago0 dependents licensed under $MIT
33

A library with a bunch of algorithms related to grids.

published version 0.10.0, 3 years ago0 dependents licensed under $MIT
33

Efficient implementation of Dijkstra's algorithm, with TypeScript support. This package is designed to be usable in both Node.js and browsers.

published version 0.0.3, a year ago0 dependents licensed under $MIT
25

Dijkstra's algorithm implentation by Node.js

published version 1.0.3, 6 years ago0 dependents licensed under $MIT
24

A simple implementation of Dijkstra's algorithm for shortest path calculation on a mesh surface using Three.js.

published version 1.0.3, 6 months ago0 dependents licensed under $MIT
23

A NodeJS implementation of Dijkstra's algorithm

published version 1.0.1, 6 years ago0 dependents licensed under $MIT
14