numr 0.5.1

High-performance numerical computing with multi-backend GPU acceleration (CPU/CUDA/WebGPU)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

//! Bipartite matching algorithms for sparse matrices.
//!
//! Maximum matching algorithms to find row/column permutations that maximize
//! nonzeros on the diagonal. These are CPU-only graph algorithms that operate
//! on sparsity structure.
//!
//! # Algorithms
//!
//! - **Hopcroft-Karp**: O(E√V) maximum cardinality matching
//!
//! # Use Cases
//!
//! - **Maximum transversal**: Find row permutation to maximize diagonal nonzeros
//! - **Structural rank**: Determine if matrix has full structural rank
//! - **BTF preprocessing**: Prepare matrix for block triangular form decomposition

pub mod hopcroft_karp;
pub mod traits;

pub use hopcroft_karp::{MatchingResult, hopcroft_karp, maximum_transversal};
pub use traits::BipartiteMatching;