Shortest Packages

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

JavaScript diagramming library

A javascript equivalent of Python's zip function

Fast shortest path finder for grids

faster, feature rich dijkstra for real world applications

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

API Client for connect with shorte.st.

Algorithm for finding shortest and widest paths in a weighted graph

A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.

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

Merge n number of arrays by shortest or longest array

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

Better Approach To Getting Interconnected Relation Lists

NodeJS module to calculate shortest path given N points using Dijikstra's algorithm

Graph data structure with path finding and traversing algorithms

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

Simple and fast library for graphs and calculating shortest paths

The shortest syntax for functional switch-case

Index for fast distance and shortest path queries on weighted directed graphs

> an A\* algorithm in javascript