evenfurther/pathfinding

Health v2 · maintenance only

Flags: no_license

Adoption not part of the score

1070 stars · 90 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

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

library · maturity stable

parser developer-tools developer-tools rust pathfinding graph-algorithms astar dijkstra bfs max-flow edmonds-karp kuhn-munkres shortest-path generic-algorithms algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="evenfurther/pathfinding")