weavatrix-graph 0.6.2

Deterministic, evidence-carrying graph core for Weavatrix repository intelligence
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133

#![cfg_attr(feature = "unsafe-fast", allow(unsafe_code))]

use weavatrix_graph::{
    BitMatrix, GraphView, NodeIndex, RandomGraphGenerator, complete_bipartite_topology,
    grid_topology, star_topology,
};

#[test]
fn bit_matrix_crosses_word_boundaries_and_tracks_edges() {
    let mut matrix = BitMatrix::try_new(9).unwrap();
    for &(source, target) in &[(0, 0), (7, 0), (7, 1), (8, 8)] {
        assert!(matrix.insert(node(source), node(target)).unwrap());
        assert!(!matrix.insert(node(source), node(target)).unwrap());
    }
    assert_eq!(matrix.edge_count(), 4);
    assert_eq!(matrix.storage_bytes(), 16);
    assert_eq!(
        matrix
            .outgoing(node(7))
            .map(NodeIndex::index)
            .collect::<Vec<_>>(),
        vec![0, 1]
    );
    assert_eq!(
        matrix
            .incoming(node(8))
            .map(NodeIndex::index)
            .collect::<Vec<_>>(),
        vec![8]
    );
    assert!(matrix.remove(node(7), node(0)));
    assert!(!matrix.remove(node(7), node(0)));
    assert_eq!(matrix.edge_count(), 3);
    assert!(!matrix.contains(node(99), node(0)));
}

#[test]
fn bit_matrix_materializes_topology_and_validates_wire_data() {
    let mut matrix = BitMatrix::try_new(3).unwrap();
    matrix.insert(node(0), node(1)).unwrap();
    matrix.insert_undirected(node(1), node(2)).unwrap();
    let topology = matrix.to_topology().unwrap();
    assert_eq!(
        topology
            .edge_references()
            .map(|(_, edge)| (edge.source().index(), edge.target().index()))
            .collect::<Vec<_>>(),
        vec![(0, 1), (1, 2), (2, 1)]
    );

    let mut value = serde_json::to_value(&matrix).unwrap();
    value["edge_count"] = serde_json::json!(99);
    assert_eq!(
        serde_json::from_value::<BitMatrix>(value)
            .unwrap()
            .edge_count(),
        3
    );
    assert!(
        serde_json::from_value::<BitMatrix>(serde_json::json!({
            "node_count": 1,
            "edge_count": 0,
            "words": [2]
        }))
        .is_err()
    );
}

#[test]
fn deterministic_generators_cover_standard_p2_shapes() {
    let star = star_topology(5).unwrap();
    assert_eq!(pairs(&star), vec![(0, 1), (0, 2), (0, 3), (0, 4)]);

    let grid = grid_topology(2, 3).unwrap();
    assert_eq!(
        pairs(&grid),
        vec![(0, 1), (0, 3), (1, 2), (1, 4), (2, 5), (3, 4), (4, 5)]
    );

    let bipartite = complete_bipartite_topology(2, 3).unwrap();
    assert_eq!(
        pairs(&bipartite),
        vec![(0, 2), (0, 3), (0, 4), (1, 2), (1, 3), (1, 4)]
    );
}

#[test]
fn seeded_dag_generator_is_reproducible_and_acyclic_by_construction() {
    let mut first = RandomGraphGenerator::new(42);
    let mut second = RandomGraphGenerator::new(42);
    let first = first.dag(32, 1, 4).unwrap();
    let second = second.dag(32, 1, 4).unwrap();
    assert_eq!(first, second);
    assert!(
        first
            .edge_references()
            .all(|(_, edge)| edge.source().index() < edge.target().index())
    );
}

#[cfg(feature = "unsafe-fast")]
#[test]
fn fast_bit_lookups_match_safe_mode_and_keep_a_safe_checked_entrypoint() {
    let mut matrix = BitMatrix::try_new(65).unwrap();
    matrix.insert(node(1), node(64)).unwrap();
    for source in 0..65 {
        for target in 0..65 {
            let source = node(source);
            let target = node(target);
            assert_eq!(
                matrix.contains_fast(source, target),
                matrix.contains(source, target)
            );
            // SAFETY: Both loop indexes are inside the 65-node matrix.
            assert_eq!(
                unsafe { matrix.contains_unchecked(source, target) },
                matrix.contains(source, target)
            );
        }
    }
    assert!(!matrix.contains_fast(node(65), node(0)));
}

fn pairs(graph: &weavatrix_graph::Topology) -> Vec<(usize, usize)> {
    graph
        .edge_references()
        .map(|(_, edge)| (edge.source().index(), edge.target().index()))
        .collect()
}

fn node(index: u32) -> NodeIndex {
    NodeIndex::new(index)
}