JSPM

A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.

An implementation of the Fibonacci heap data structure

Comprehensive pathfinding library for grid based games

Shortest path functions for graphology.

Package implements data structures and algorithms for processing various types of graphs

Standard data structure

A NodeJS implementation of Dijkstra's algorithm

Comprehensive pathfinding library for grid based games

JavaScript Graph Layouting and Drawing

A package to calculate the shortest sea route between two points on Earth.

A modern JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.

Find all/least-cost routes in weighted directed graph with given limitations

AURA - Adaptive Unified Routing Algorithms: A modern ES package providing graph shortest-path algorithms (Aura, Dijkstra, A*).

Computes the K shortest paths in a graph from node s to node t using Yen's algorithm

Fast shortest path finder for grids

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

Implementation of dijkstra's algorithm

TypeScript implementation of the algorithm that breaks the sorting barrier for directed single-source shortest paths

faster, feature rich dijkstra for real world applications

Fast node.js pathfinding on workers for grid-based games

Convert math expressions between postfix (RPN) and infix notations and evaluate them

Dijkstra algorithm optimized with priority queue.

Comprehensive pathfinding library for grid based games

Shortest path strategies in JS

A TypeScript library for calculating shortest paths between geographical points using Dijkstra's algorithm and Haversine distance

Data structure and graph processing library written in modern JavaScript

A* search algorithm for asynchronous data sources

Functional Programming Style Search Algorithms and Unordered Containers

Contraction Hierarchy

Intelligent masonry style photo gallery that maintains image aspect ratios in perfect rows.

excalibur-pathfinding provides ability to use A* and Dijkstra's Algorithm for pathfinding and with Excalibur.js

"SDK for commonly used data structure and algorithms"

High-performance TypeScript graph algorithms library optimized for trading bots and arbitrage detection

Comprehensive pathfinding library for grid based games

Dijkstra TypeScript implementation

Data structures and algorithms written in JavaScript

Pathfinder algorithm written in typescript. Uses all the power of Dijkstra algorithm.

Calculate the weights between each vertex node and help you find the fastest route.

Generate maze using randomized DFS and Solve it using Path Finding algorithms

Fast shortest path finder for grids

Tools for graphs representing 2-D spatial points and links between them.

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

A comprehensive graph library with shortest path algorithms and visualization capabilities

Simple and fast library for graphs and calculating shortest paths

Comprehensive pathfinding library for grid based games

A collection of common graph and string algorithms in JavaScript, including Dijkstra's, Floyd-Warshall, Union-Find, Naive Pattern Matching, and Rabin-Karp.

excalibur-pathfinding provides ability to use A* and Dijkstra's Algorithm for pathfinding and with Excalibur.js

Graph data structure with path finding and traversing algorithms

A powerful isochrone and routing engine based on Dijkstra's algorithm for accurate travel time calculations.

A simple undirected graph that allows for finding the shortest path between nodes via Dijkstra's algorithm

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

Try to find the shortest path between two points of an image, following pixels matching a given colors pattern. Usefull to find the shortest path between two locations on a map, by following roads.

Comprehensive pathfinding library for grid based games

Some pathfinding algorithm implementations

A library with a bunch of algorithms related to grids.

A JavaScript A* path finding library that allows for asynchronously loading graph data.

typescript implementation of the greedy first search djikstra's shortest path algorithm, compatible with javascript projects too of course

Dijkstra Shortest Path Algorithm implemented as a nodejs native module

Data structures and algorithms written in JavaScript with TypeScript types

dijkstra,algorithm

Using dijkstra algorithm to find shortest way for currency conversation

A TypeScript implementation of Dijkstra's algorithm for finding shortest paths in graphs

A NodeJS implementation of Dijkstra's algorithm

Implementation of Dijkstra's algorithm that returns a shortest path tree

Dijkstra shortest path algorithm implemented in C++ and comiled to wasm

Implementation of the Dijkstra's Algorithm to compute the shortest path between a starting and ending node ina graph.

Comprehensive pathfinding library for grid based games

dijkstra algorithm

Examples of Data Structures and Coding Challenges

找到两个顶点之间的最短路径。

Dijkstra's algorithm implementation in JavaScript

Dijkstra's algorithm implentation by Node.js

Javascript package implementation of the bmssp algorithm.

Algorithms for Three Dimensional Path Planning

Comprehensive pathfinding library for grid based games