A priority queue for Rust with efficient change function.

🕸️ Efficient priority queue compiled to WebAssembly

Priority queue traits and efficient d-ary heap implementations.

An indexed priority queue with index-based removals, restores and value updates.

Offer structure representation of data structures

Common data structure and algorithms for rust-lang

A rust implementation of the modified Planchon and Darboux algorithm for sink-filling in Digital Elevation Models.

RPQ is a high performance embeddable double priority queue with complex priority ordering guarantees

A Fibonacci Heap implementation in Rust

n_puzzle @ 42 - N-puzzle problem solver written in Rust

Data Structures & Algorithms in Rust

Benchmarks for single source single sink shortest path implementations

High-performance, zero-overhead event dispatcher for Rust. Thread-safe, async-ready with priority system. Type-safe observer pattern for decoupled architectures.