A high-performance Fibonacci Heap implementation in Rust with generic type support
A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations
Very generic containers including KD trees, fibonacci heaps, minmax heaps, ...
simple but actually useful Fibonacci Heaps
A high-performance, index-based data structure toolkit. Provides an arena allocator (ElemPool) used to build a cache-friendly PieList (doubly-linked list) and FibHeap (priority queue).
A library providing heap data structures
A crate for common data structures and algorithms
Algorithms & Data Structure implementations
Swap out of the OS-provided stack
A (fast) implementation of pairing heap data structure for priority queue and some graph algorithms
A trait-based collection library that implement different data structures using the same trait.
The procedural macros for the collection crate
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.