ml-floyd-warshall
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
srikar526_graph_and_string_algorithms
A collection of common graph and string algorithms in JavaScript, including Dijkstra's, Floyd-Warshall, Union-Find, Naive Pattern Matching, and Rabin-Karp.
floyd-warshall
Algorithm for finding shortest and widest paths in a weighted graph
@dr-nio/aura-path-algorithms
AURA - Adaptive Unified Routing Algorithms: A modern ES package providing graph shortest-path algorithms (Aura, Dijkstra, A*).