holos-tda 0.9.0

Vietoris-Rips persistence and checked degree-Rips modules
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87

use super::*;
use crate::SparseDistanceMatrix;

fn model() -> PlanarCoverageModel {
    PlanarCoverageModel::new(1.0, 1.0).unwrap()
}

fn wheel() -> SparseDistanceMatrix {
    SparseDistanceMatrix::from_triplets(
        5,
        &[
            (0, 1, 1.0),
            (1, 2, 1.0),
            (2, 3, 1.0),
            (0, 3, 1.0),
            (0, 4, 1.0),
            (1, 4, 1.0),
            (2, 4, 1.0),
            (3, 4, 1.0),
        ],
    )
    .unwrap()
}

#[test]
fn a_wheel_fills_its_fence_over_several_fields() {
    let fence = CoverageFence::new(vec![0, 1, 2, 3]).unwrap();
    for modulus in [2, 3, 5] {
        let evaluation = evaluate_planar_coverage(
            &wheel(),
            &[0, 1, 2, 3, 4],
            &fence,
            modulus,
            model(),
            CoverageLimits::default(),
        )
        .unwrap();
        assert!(evaluation.criterion_holds);
        assert_eq!(evaluation.active_triangles, 4);
        assert_eq!(evaluation.witness.len(), 4);
    }
}

#[test]
fn the_unfilled_fence_fails_the_criterion() {
    let evaluation = evaluate_planar_coverage(
        &wheel(),
        &[0, 1, 2, 3],
        &CoverageFence::new(vec![0, 1, 2, 3]).unwrap(),
        2,
        model(),
        CoverageLimits::default(),
    )
    .unwrap();
    assert!(!evaluation.criterion_holds);
    assert!(evaluation.witness.is_empty());
}

#[test]
fn fence_order_has_one_canonical_orientation() {
    let expected = CoverageFence::new(vec![0, 1, 2, 3]).unwrap();
    assert_eq!(expected, CoverageFence::new(vec![2, 3, 0, 1]).unwrap());
    assert_eq!(expected, CoverageFence::new(vec![2, 1, 0, 3]).unwrap());
}

#[test]
fn radius_inequality_uses_exact_dyadic_values() {
    assert!(PlanarCoverageModel::new(1.0, 0.5).is_err());
    assert!(PlanarCoverageModel::new(1.0, 0.6).is_ok());
}

#[test]
fn a_missing_fence_edge_is_rejected() {
    let graph =
        SparseDistanceMatrix::from_triplets(4, &[(0, 1, 1.0), (1, 2, 1.0), (2, 3, 1.0)]).unwrap();
    assert!(
        evaluate_planar_coverage(
            &graph,
            &[0, 1, 2, 3],
            &CoverageFence::new(vec![0, 1, 2, 3]).unwrap(),
            2,
            model(),
            CoverageLimits::default(),
        )
        .is_err()
    );
}