ruvector-mincut 2.0.6

World's first subpolynomial dynamic min-cut: self-healing networks, AI optimization, real-time graph analysis
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

//! Instance module for bounded-range minimum cut
//!
//! This module provides the core abstractions for maintaining minimum proper cuts
//! over dynamic graphs with bounded cut values.

pub mod bounded;
pub mod stub;
pub mod traits;
pub mod witness;

pub use bounded::BoundedInstance;
pub use stub::StubInstance;
pub use traits::{InstanceResult, ProperCutInstance};
pub use witness::{ImplicitWitness, Witness, WitnessHandle};

#[cfg(test)]
mod tests {
    use super::*;
    use roaring::RoaringBitmap;

    #[test]
    fn test_module_exports() {
        let witness = WitnessHandle::new(0, RoaringBitmap::from_iter([0, 1]), 2);
        assert_eq!(witness.seed(), 0);

        let result = InstanceResult::ValueInRange {
            value: 2,
            witness: witness.clone(),
        };
        assert!(result.is_in_range());
    }

    #[test]
    fn test_witness_trait_object() {
        let witness = WitnessHandle::new(5, RoaringBitmap::from_iter([5, 6, 7]), 4);
        let trait_obj: &dyn Witness = &witness;

        assert_eq!(trait_obj.seed(), 5);
        assert_eq!(trait_obj.cardinality(), 3);
        assert!(trait_obj.contains(5));
        assert!(!trait_obj.contains(10));
    }
}