23 packages found

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

    published 1.0.2 a year ago
    M
    Q
    P

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

    published 1.1.2 8 months ago
    M
    Q
    P

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

    published 1.2.0 6 years ago
    M
    Q
    P

    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.

    published 0.0.1 2 months ago
    M
    Q
    P

    > an A\* algorithm in javascript

    published 0.2.0 2 years ago
    M
    Q
    P

    Graph data structure with path finding and traversing algorithms

    published 0.1.9 3 years ago
    M
    Q
    P

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

    published 0.2.0 5 years ago
    M
    Q
    P

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

    published 1.0.0 5 years ago
    M
    Q
    P

    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 0.1.13 5 years ago
    M
    Q
    P

    faster, feature rich dijkstra for real world applications

    published 1.0.4 3 years ago
    M
    Q
    P

    Implementation of commonly used data structures and utilities in JavaScript.

    published 0.6.14 8 years ago
    M
    Q
    P

    Fast shortest path finder for grids

    published 1.0.0 7 years ago
    M
    Q
    P

    The Route Exploration Algorithm is a graph traversal library implemented in TypeScript with BFS in mind

    published 1.0.0 8 months ago
    M
    Q
    P

    Implementation of dijkstra's algorithm

    published 0.0.1 9 years ago
    M
    Q
    P

    Algorithm for finding shortest and widest paths in a weighted graph

    published 1.0.0 6 years ago
    M
    Q
    P

    Bellman Ford algorithm for node.js

    published 0.0.6 9 years ago
    M
    Q
    P

    Dijkstra & Floyd Warshall implementation for weighted directed and undirected graphs with iteration logging.

    published 1.2.2 a year ago
    M
    Q
    P

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

    published 0.2.6 4 years ago
    M
    Q
    P

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

    published 0.0.1 5 years ago
    M
    Q
    P

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

    published 0.0.5 3 years ago
    M
    Q
    P