A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
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.
Computes the K shortest paths in a graph from node s to node t using Yen's algorithm