JSPM

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

JavaScript diagramming library

given an input character set, create an iterator function that returns the next shortest string available

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

A javascript equivalent of Python's zip function

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

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

Fast shortest path finder for grids

Implementation of dijkstra's algorithm

faster, feature rich dijkstra for real world applications

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.

Merge n number of arrays by shortest or longest array

Bellman Ford algorithm for node.js

bellmanford ===========

Algorithm for finding shortest and widest paths in a weighted graph

Fast shortest path finder for grids

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

Graph data structure with path finding and traversing algorithms

> an A\* algorithm in javascript

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

Simple and fast library for graphs and calculating shortest paths

The shortest syntax for functional switch-case

API Client for connect with shorte.st.

Better Approach To Getting Interconnected Relation Lists

prime numbers by ayush

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

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

shortest paths that become 'more popular' with repeated use. simulate forest trail formation, infrastructure network growth, plant root growth, mold growth, other analogous phenomena, etc.

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

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

Graph based algorithm for traversing and finding the shortest path between two countries

This is a simple and tiney utility library of javascript. There has some of common and most useful methods. These are need every single day.