Expand description
Algorithms Library for Rust
A comprehensive, zero-dependency collection of common algorithms.
Structs§
- Edge
- Weighted edge for graph algorithms.
Enums§
- Error
- Errors that can be returned by algorithms in this crate.
Functions§
- a_star
- A* shortest path.
- activity_
selection - Maximum compatible activity indices.
- bellman_
ford - Bellman-Ford shortest paths with negative cycle detection.
- bfs
- Breadth-first search.
- binary_
search - Binary search.
- boyer_
moore_ search - Boyer-Moore pattern matching with the bad-character rule.
- count_
inversions - Inversion count.
- dfs
- Depth-first search.
- dijkstra
- Dijkstra’s shortest paths.
- edit_
distance - Levenshtein distance.
- fast_
power - Exponentiation by squaring.
- fractional_
knapsack - Fractional knapsack maximum value.
- heap_
sort - Binary max-heap sort.
- huffman_
coding - Huffman coding.
- interpolation_
search - Interpolation search for numeric data.
- jump_
search - Jump search.
- kmp_
search - Knuth-Morris-Pratt pattern matching.
- knapsack_
01 - 0/1 knapsack.
- longest_
common_ subsequence - Longest common subsequence length.
- max_
subarray - Maximum subarray sum.
- merge_
sort - Stable merge sort.
- quick_
sort - Quick sort.
- rabin_
karp_ search - Rolling-hash pattern matching.
- radix_
sort - LSD radix sort for non-negative integers.
- tim_
sort - Standard-library sort (Timsort-like).