Fast directed-acyclic-graph library with Dijkstra search and attribute-based path filtering. The graph kernel of the Automata Atelier workspace.
An implementation of 2D EDT (Euclidian distance transform) with Saito's algorithm in pure Rust
A Dijkstra's algorithm implementation that aims to be simple to use and fast to run
A high-performance library for visibility graph computation from time series data
An absurdly fast embedded graph database. Pure Rust, sub-microsecond reads.
Blazingly fast shortest paths with (parallel) preprocessing via contraction hierarchies and hub labeling
A PDDL planner library built around the pddl crate, with grounding and search utilities
CLI for the miniplan PDDL planner
Quickly approximate Paths on a Grid
Fast shortest path calculations on directed graphs made possible by pre-processing the graph using Contraction Hierarchies
Efficient Rust implementation of Brandes algorithm for computing betweenness centrality on graphs with support for complex structures.
Rust implementation of RAPTOR (Round-bAsed Public Transit Routing)
No description provided.
No description provided.