# evenfurther/pathfinding

Pathfinding library for rust

Repository: https://github.com/evenfurther/pathfinding
Canonical: https://ross.abutalabs.com/products/pathfinding
Language: Rust
License Family: other
Topics: pathfinding, graph, edmonds-karp, kuhn-munkres, dijkstra, astar, hacktoberfest, rust
Last push: 2026-08-08T08:41:11+00:00

## Health v2 (maintenance only)
Score: 89/100 (v2, computed 2026-09-03T02:20:16.233290+00:00)
- activity 96, release rhythm 74, longevity 100
- inputs: {"age_days": 3536, "days_push": 25, "days_rel": 176, "gap_med": 17.0, "n_releases_24m": 5}
- flags: no_license
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 1070, forks 90 (observed 2026-08-28T04:03:27.928115+00:00)

## What it is
A Rust crate implementing pathfinding, flow, and graph algorithms such as BFS, DFS, A*, Dijkstra, Edmonds-Karp, and Kuhn-Munkres, generic over node types. It is widely used (2.7M+ downloads) and actively maintained with regular releases.

## Use cases
- find shortest path in a grid or graph in Rust
- implement A* search for game movement
- compute max flow with Edmonds-Karp
- solve assignment problems with Kuhn-Munkres
- run BFS/DFS on custom node types
- weighted graph shortest paths with Dijkstra

## When to choose
- you need well-tested generic graph and pathfinding algorithms in Rust
- you want a lightweight crate with no heavy dependencies
- you need both unweighted (BFS/DFS) and weighted (A*/Dijkstra) search

## When to avoid
- you need a full graph data structure library with persistent graph types
- you work outside the Rust ecosystem
- you need parallel or GPU-accelerated graph processing

## Facets
- artifact type: library
- maturity: stable
- function: parser, developer-tools
- domain: developer-tools
- platform: rust
- tags: pathfinding, graph-algorithms, astar, dijkstra, bfs, max-flow, edmonds-karp, kuhn-munkres, shortest-path, generic-algorithms, algorithms

## Member repositories
- evenfurther/pathfinding (main) score 89

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:03:27.928115+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-30T06:54:00.657406+00:00, confidence not recorded.
  - readme: https://github.com/evenfurther/pathfinding (fetched 2026-08-28T04:03:27.928115+00:00, sha f5aed5242452)
  - registry_crates: https://crates.io/api/v1/crates/pathfinding (fetched 2026-08-29T12:56:07.038529+00:00, sha 49d8db91ad96)
- Data as of 2026-08-30T08:39:29.467469+00:00.