Dijkstra Packages

implemented of weighted and directed graph

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

Examples of Data Structures and Coding Challenges

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

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

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

nv-dag-adjmat is a simple util for adjacency-table for graph

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

Comprehensive pathfinding library for grid based games

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

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

Fast shortest path finder for grids

Functional Programming Style Search Algorithms and Unordered Containers

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

Dijkstra Shortest Path Algorithm implemented as a nodejs native module

Comprehensive pathfinding library for grid based games

"SDK for commonly used data structure and algorithms"

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

Dijkstra's algorithm implementation in JavaScript

Standard data structure