EbTech/rust-algorithms
Rust Algorithms
Dies ist eine Sammlung von Standard-Datenstrukturen und algorithmischen Implementierungen, die in Rust geschrieben wurden. Sie bietet eine Suite spezialisierter Bibliotheken, die für Competitive Programming und Systemtechnik entwickelt wurden.
Das Projekt ist in verschiedene Toolkits für Graphentheorie, Zahlentheorie, Bereichsabfragen und Textverarbeitung unterteilt. Es enthält Implementierungen zur Berechnung kürzester Pfade und Netzwerkflüsse, zur Durchführung von Primzahltests und modularer Arithmetik sowie zur Verwaltung assoziativer Bereichsabfragen.
Die Bibliothek deckt breite Rechenbereiche ab, einschließlich Signalverarbeitung mittels Fast-Fourier-Transformationen, Textanalyse unter Verwendung von Suffix-Arrays und Tries sowie Datenorganisation durch Koordinatenkomprimierung und Sortierdienstprogramme. Sie bietet zudem Werkzeuge zum Parsen von Eingabedaten aus Dateien oder Standard-I/O.
Features
- Competitive Programming Toolkits - Provides a comprehensive toolkit of efficient data structures and algorithms tailored for competitive programming in Rust.
- Competitive Programming Libraries - Provides a specialized suite of standard data structures and algorithms in Rust for competitive programming and systems engineering.
- Graph Libraries - Provides a comprehensive library of graph algorithms including shortest paths and network flow implemented in Rust.
- Adjacency Lists - Implements adjacency lists for efficient graph representation and traversal of sparse network structures.
- Network Flow Algorithms - Provides algorithms for calculating maximum flow and minimum cuts in directed graphs.
- Minimum Spanning Tree Algorithms - Implements both shortest path and minimum spanning tree algorithms for graph analysis.
- Graph Algorithm Routines - Implements reusable routines for shortest paths, minimum spanning trees, and maximum flow for competitive programming.
- Lazy Propagation - Provides segment trees with lazy propagation for efficient deferred range updates and queries.
- Binary Indexed Trees - Provides binary indexed trees (Fenwick trees) for fast range sum queries and element updates.
- Number Theory Algorithms - Implements computational number theory algorithms such as GCD, modular inverses, and primality testing.
- Complex and Modular Arithmetic - Provides a utility for high-precision calculations involving rational, complex, and modular arithmetic.
- Modular Arithmetic Classes - Provides modular arithmetic wrappers to handle calculations within a fixed prime modulus.
- Primality Testing - Provides primality tests and greatest common divisor calculations for integer arithmetic.
- Range Queries - Implements associative range queries using segment trees and binary indexed trees.
- Range Update Queries - Provides efficient range update and query capabilities using binary indexed trees and segment trees with lazy propagation.
- Disjoint Set Union - Provides a disjoint-set union (union-find) implementation with path compression for connectivity tracking.
- String Matching Algorithms - Provides implementations for tries, suffix arrays, and pattern matching to analyze text sequences.
- String Processing Algorithms - Implements advanced string processing algorithms including suffix arrays and tries for text analysis.
- String Matching Tries - Implements trie-based structures for fast prefix lookups and string retrieval.
- Coordinate Compression - Implements coordinate compression to reduce memory usage when sorting large sparse value ranges.
- Fourier Transform Implementations - Implements fast Fourier transforms and convolutions for frequency domain analysis and polynomial multiplication.
- Fourier Transforms - Implements fast Fourier transforms for converting signals between time and frequency domains.
- Sorting and Searching Implementations - Provides a collection of classic sorting and searching implementations including binary search and merge sort.
- Rust in practice - Listed in the “Rust in practice” section of the Rust Learning awesome list.
