TypeScript definitions for node-dijkstra

Dijkstra TypeScript implementation

A NodeJS implementation of Dijkstra's algorithm

Dijkstra algorithm optimized with priority queue.

Generic graph search using A* or Dijkstra.

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

faster, feature rich dijkstra for real world applications

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

Dijkstra calculator for the shortest path in a graph of nodes given a weight.

bi-directional dijkstra search

Dijkstra Shortest Path Algorithm implemented as a nodejs native module

Fast maritime routing on the marnet graph. R-tree snap, predecessor-map Dijkstra, LRU cache.

dijkstra,algorithm

dijkstra algorithm

Dijkstra calculator for the shortest path in a graph of nodes given a weight.

dynamic shortest path algorithim

Algorithm's Dijkstra Shortest Finder

Production-grade maritime routing engine — A* ocean pathfinding, Dijkstra waypoint routing, 510+ port database, weather-aware ETA, EEZ analysis. Zero dependencies.

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

Weight-aware shortest paths on GeoJSON LineString networks: pluggable A*/Dijkstra/ALT engines, constrained and cost-optimal snapping, multi-waypoint routes with failure policies, linear referencing and topology diagnostics.