bounded_graph 0.3.0

A thin newtype wrapper for `petgraph` to assist in the creation of graphs with restrictions on their edges
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
134
135
136
137
138
139
140
141
142
143
144

use crate::{BoundedGraph, BoundedGraphError, SymmetricFixedEdgeCount};

#[test]
fn test_fixed_edge_count_basic() {
    let mut graph = BoundedGraph::<SymmetricFixedEdgeCount<2>, ()>::new();
    let n1 = graph.add_node(SymmetricFixedEdgeCount::empty());
    let n2 = graph.add_node(SymmetricFixedEdgeCount::empty());
    let n3 = graph.add_node(SymmetricFixedEdgeCount::empty());

    // Should be able to add 2 edges from n1
    assert!(graph.add_edge(n1, n2, ()).is_ok());
    assert!(graph.add_edge(n1, n3, ()).is_ok());

    // Third edge should fail
    let n4 = graph.add_node(SymmetricFixedEdgeCount::empty());
    let result = graph.add_edge(n1, n4, ());
    assert!(result.is_err());
    assert!(matches!(
        result.unwrap_err(),
        BoundedGraphError::EdgeRejected {
            source_rejected: true,
            target_rejected: false,
            ..
        }
    ));
}

#[test]
fn test_fixed_edge_count_with_data() {
    #[derive(Debug, Clone, PartialEq)]
    struct NodeData {
        name: String,
        value: i32,
    }

    let mut graph = BoundedGraph::<SymmetricFixedEdgeCount<3, NodeData>, i32>::new();
    let n1 = graph.add_node(SymmetricFixedEdgeCount::new(NodeData {
        name: "first".to_string(),
        value: 100,
    }));
    let n2 = graph.add_node(SymmetricFixedEdgeCount::new(NodeData {
        name: "second".to_string(),
        value: 200,
    }));

    assert_eq!(graph[n1].data.name, "first");
    assert_eq!(graph[n1].data.value, 100);
    assert_eq!(graph[n2].data.name, "second");

    assert!(graph.add_edge(n1, n2, 42).is_ok());
    assert_eq!(graph.edge_count(), 1);
}

#[test]
fn test_fixed_edge_count_with_data_deref() {
    #[derive(Debug, Clone, PartialEq)]
    struct NodeData {
        name: String,
        value: i32,
    }

    let mut graph = BoundedGraph::<SymmetricFixedEdgeCount<3, NodeData>, i32>::new();
    let n1 = graph.add_node(SymmetricFixedEdgeCount::new(NodeData {
        name: "first".to_string(),
        value: 100,
    }));
    let n2 = graph.add_node(SymmetricFixedEdgeCount::new(NodeData {
        name: "second".to_string(),
        value: 200,
    }));

    // Test Deref - accessing fields directly
    assert_eq!(graph[n1].name, "first");
    assert_eq!(graph[n1].value, 100);
    assert_eq!(graph[n2].name, "second");

    assert!(graph.add_edge(n1, n2, 42).is_ok());
    assert_eq!(graph.edge_count(), 1);
}

#[test]
fn test_fixed_edge_count_default() {
    let node = SymmetricFixedEdgeCount::<5>::default();
    assert_eq!(node.data, ());

    let node_with_int = SymmetricFixedEdgeCount::<3, i32>::default();
    assert_eq!(node_with_int.data, 0);
}

#[test]
fn test_fixed_edge_count_empty() {
    let node = SymmetricFixedEdgeCount::<2>::empty();
    assert_eq!(node.data, ());

    // Can also use with explicit type
    let node2 = SymmetricFixedEdgeCount::<5>::empty();
    assert_eq!(node2.data, ());
}

#[test]
fn test_fixed_edge_count_zero_capacity() {
    let mut graph = BoundedGraph::<SymmetricFixedEdgeCount<0>, ()>::new();
    let n1 = graph.add_node(SymmetricFixedEdgeCount::empty());
    let n2 = graph.add_node(SymmetricFixedEdgeCount::empty());

    // Should not be able to add any edges
    let result = graph.add_edge(n1, n2, ());
    assert!(result.is_err());
    assert!(matches!(
        result.unwrap_err(),
        BoundedGraphError::EdgeRejected {
            source_rejected: true,
            target_rejected: true,
            ..
        }
    ));
}

#[test]
fn test_fixed_edge_count_from_edges() {
    let edges = vec![(0, 1), (1, 2), (2, 0)];
    let graph = BoundedGraph::<SymmetricFixedEdgeCount<5>, ()>::from_edges(&edges);

    assert_eq!(graph.node_count(), 3);
    assert_eq!(graph.edge_count(), 3);
}

#[test]
fn test_deref_mut() {
    #[derive(Debug, Clone, PartialEq)]
    struct NodeData {
        count: i32,
    }

    let mut graph = BoundedGraph::<SymmetricFixedEdgeCount<3, NodeData>, ()>::new();
    let n1 = graph.add_node(SymmetricFixedEdgeCount::new(NodeData { count: 0 }));

    // Test DerefMut - modifying fields directly
    graph[n1].count += 5;
    assert_eq!(graph[n1].count, 5);

    graph[n1].count *= 2;
    assert_eq!(graph[n1].count, 10);
}