Search results

31 packages found

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

published version 1.0.3, 2 years ago65 dependents licensed under $MIT
14,838,027

JavaScript diagramming library

published version 4.1.3, 5 months ago24 dependents licensed under $MPL-2.0
64,812

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

published version 0.0.0, 13 years ago7 dependents licensed under $MIT
8,925

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

published version 1.1.2, 4 years ago0 dependents licensed under $MIT
616

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

published version 0.0.5, 6 years ago0 dependents licensed under $MIT
344

faster, feature rich dijkstra for real world applications

published version 1.0.4, 6 years ago0 dependents licensed under $MIT
173

Fast shortest path finder for grids

published version 1.0.0, 10 years ago4 dependents licensed under $MIT
175

Implementation of dijkstra's algorithm

published version 0.0.1, 12 years ago0 dependents licensed under $MPL
134

A javascript equivalent of Python's zip function

published version 1.0.1, 9 years ago8 dependents licensed under $ISC
113

> an A\* algorithm in javascript

published version 0.2.0, 5 years ago0 dependents licensed under $MIT
83

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.

published version 0.1.13, 8 years ago0 dependents licensed under $MIT
49

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

published version 1.2.0, 9 years ago0 dependents licensed under $MIT
34

Graph data structure with path finding and traversing algorithms

published version 0.1.9, 6 years ago0 dependents licensed under $MIT
37

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

published version 0.2.6, 7 years ago0 dependents licensed under $MIT
31

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

published version 1.2.0, a year ago0 dependents licensed under $MIT
23

Bellman Ford algorithm for node.js

published version 0.0.6, 12 years ago0 dependents
25

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

published version 0.2.0, 7 years ago1 dependents licensed under $GPL-3.0
23

Merge n number of arrays by shortest or longest array

published version 0.1.6, 9 years ago0 dependents licensed under $MIT
21

API Client for connect with shorte.st.

published version 1.0.0, 9 years ago0 dependents licensed under $MIT
23

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

published version 1.2.0, 12 years ago0 dependents licensed under $BSD
21