Shortest path Packages

A NodeJS implementation of Dijkstra's algorithm

Shortest path functions for graphology.

A NodeJS implementation to find all possible paths from a graph.

Data structure and graph processing library written in modern JavaScript

Shortest path strategies in JS

A library with a bunch of algorithms related to grids.

Simple implementation of basic algorithms.

Complex Network Analysis Tool.

Graph data structure with path finding and traversing algorithms

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

Bellman-Ford's algorithm implentation by Node.js

Dijkstra's algorithm implentation by Node.js

Algorithms

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

implemented of weighted and directed graph

Dijkstra algorithm optimized with priority queue.

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

Bellman-ford algorithm.

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

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