# anvaka/ngraph.path

Path finding in a graph

Repository: https://github.com/anvaka/ngraph.path
Canonical: https://ross.abutalabs.com/products/ngraphpath
Homepage: https://anvaka.github.io/ngraph.path.demo/
Language: JavaScript
License: MIT
License Family: permissive
Topics: graph, pathfinder, heuristic, heap, finder, algorithm
Last push: 2026-07-27T05:08:44+00:00

## Health v2 (maintenance only)
Score: 75/100 (v2, computed 2026-09-02T17:46:02.011165+00:00)
- activity 94, release rhythm 35, longevity 100
- inputs: {"age_days": 3279, "days_push": 37, "days_rel": null, "gap_med": null, "n_releases_24m": 0}
- flags: no_releases
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 3134, forks 192 (observed 2026-08-28T04:07:45.644598+00:00)

## What it is
A fast JavaScript library for finding shortest paths in arbitrary graphs, implementing A*, bidirectional A* (NBA*), and Dijkstra algorithms. It is optimized with a custom heap-based priority queue and object pooling for high performance on large graphs like road networks.

## Use cases
- find shortest path in a road network graph
- implement A* pathfinding in JavaScript
- compute routes on a large graph quickly
- bidirectional A* search library
- run Dijkstra's algorithm on a graph
- pathfinding for map or game navigation

## When to choose
- you need fast shortest-path queries on large graphs in JavaScript
- you want optimal paths via NBA* without balanced heuristics
- you work with ngraph graph structures

## When to avoid
- you need pathfinding in a non-JavaScript environment
- you need dynamic graphs with frequent edge updates
- you need only simple BFS on tiny graphs where a full library is overkill

## Facets
- artifact type: library
- maturity: stable
- function: search-engine, developer-tools
- domain: performance
- platform: browser
- tags: pathfinding, a-star, dijkstra, graph-algorithms, bidirectional-search, heap-priority-queue, algorithms, maps, nodejs, javascript

## Member repositories
- anvaka/ngraph.path (main) score 75

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:07:45.644598+00:00.
- Health v2: computed from the inputs above; adoption is never an input.
- Inferred fields (summary, facets, guidance): AI-extracted, prompt v1, taxonomy v1, on 2026-08-30T07:26:06.352988+00:00, confidence not recorded.
  - readme: https://github.com/anvaka/ngraph.path (fetched 2026-08-28T04:07:45.644598+00:00, sha 0f1c94df3589)
  - homepage: https://anvaka.github.io/ngraph.path.demo/ (fetched 2026-08-29T09:41:09.487205+00:00, sha 4b208ec68bc9)
  - registry_npm: https://registry.npmjs.org/ngraph.path (fetched 2026-08-29T09:41:09.496511+00:00, sha 2ce543fa9836)
- Data as of 2026-08-30T08:39:29.467469+00:00.