All Algorithms implemented in Rust
-
Updated
Mar 31, 2026 - Rust
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
All Algorithms implemented in Rust
Tools for concurrent programming in Rust
Blazing fast concurrent HashMap for Rust.
Common data structures and algorithms in Rust
🚀 efficient approximate nearest neighbor search algorithm collections library written in Rust 🦀 .
Next-gen compile-time-checked builder generator, named function's arguments, and more!
Rust persistent data structures
Rust newtype with guarantees 🇺🇦 🦀
Hex patterns, include patterns and magic files for the use with the ImHex Hex Editor
my leetcode solutions in rust
Algorithms written in Rust
Fast, efficient, and robust memory reclamation for Rust.
A library for high-performant graph algorithms.
Learn algorithms and data structures with Rust
A persistent B+Tree (clustered index) implementation in Rust.
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Delaunay Triangulations for the Rust Ecosystem
Rich text CRDT that implements Peritext and Fugue