JSPM

Simple and fast library for graphs and calculating shortest paths

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

Comprehensive pathfinding library for grid based games

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.

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

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

Dijkstra's algorithm implementation in JavaScript

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

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

Blazing fast graph pathfinding SDK powered by WebAssembly. 10-15x faster than JavaScript implementations.

Dijkstra's algorithm implentation by Node.js

Blazing fast graph pathfinding SDK powered by WebAssembly. 10-15x faster than JavaScript implementations.

Algorithms for Three Dimensional Path Planning

Comprehensive pathfinding library for grid based games