Crate advanced_algorithms

Crate advanced_algorithms 

Source
Expand description

§Advanced Algorithms Library

A comprehensive Rust library providing high-performance implementations of advanced algorithms across multiple domains including:

  • Numerical Analysis & Linear Algebra: FFT, QR Decomposition, Newton-Raphson, SVD
  • Number Theory & Cryptography: Miller-Rabin Primality Test, Extended Euclidean Algorithm, Mersenne Twister
  • Optimization & Statistics: Gradient Descent, Levenberg-Marquardt, Monte Carlo Integration
  • Graph Algorithms: Dijkstra’s, A*, Bellman-Ford, Floyd-Warshall

§Features

  • High Performance: Optimized implementations with multi-threading support via Rayon
  • Well Documented: Comprehensive documentation with examples for each algorithm
  • Type Safe: Leverages Rust’s type system for correctness
  • Numerically Stable: Implementations prioritize numerical stability

§Quick Start

use advanced_algorithms::numerical::fft;
use advanced_algorithms::optimization::gradient_descent;
use advanced_algorithms::number_theory::miller_rabin;

// Fast Fourier Transform
let signal = vec![1.0, 2.0, 3.0, 4.0];
let spectrum = fft::fft(&signal);

// Check if a number is prime
let is_prime = miller_rabin::is_prime(17, 10);

Modules§

graph
Graph algorithms
number_theory
Number theory and cryptography algorithms
numerical
Numerical analysis and linear algebra algorithms
optimization
Optimization and statistical algorithms

Enums§

AlgorithmError
Common error type for the library

Type Aliases§

Complex64
Alias for a Complex<f64>
Result
Result type for algorithm operations