ade-graph 0.1.1

Core graph data structures and utilities for directed graphs.
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

use ade_traits::NodeTrait;
use std::collections::HashSet;

#[derive(Debug, Clone)]
pub struct Node {
    key: u32,
    predecessors: HashSet<u32>,
    successors: HashSet<u32>,
}

impl Node {
    pub fn new(key: u32) -> Self {
        Node {
            key,
            predecessors: HashSet::new(),
            successors: HashSet::new(),
        }
    }
}

impl NodeTrait for Node {
    fn new(key: u32) -> Self {
        Node::new(key)
    }

    fn key(&self) -> u32 {
        self.key
    }

    fn fresh_copy(&self) -> Self {
        Node {
            key: self.key,
            predecessors: HashSet::new(),
            successors: HashSet::new(),
        }
    }

    fn predecessors(&self) -> &HashSet<u32> {
        &self.predecessors
    }

    fn successors(&self) -> &HashSet<u32> {
        &self.successors
    }

    fn add_predecessor(&mut self, key: u32) {
        self.predecessors.insert(key);
    }

    fn add_successor(&mut self, key: u32) {
        self.successors.insert(key);
    }

    fn remove_predecessor(&mut self, key: u32) {
        self.predecessors.remove(&key);
    }

    fn remove_successor(&mut self, key: u32) {
        self.successors.remove(&key);
    }
}

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

    #[test]
    fn test_node_creation() {
        let node = Node::new(1);
        assert_eq!(node.key(), 1);
        assert!(node.predecessors().is_empty());
        assert!(node.successors().is_empty());
    }

    #[test]
    fn test_fresh_copy() {
        let mut node = Node::new(42);
        node.add_predecessor(1);
        node.add_successor(2);

        let fresh_node = node.fresh_copy();

        assert_eq!(fresh_node.key(), 42);
        assert!(fresh_node.predecessors().is_empty());
        assert!(fresh_node.successors().is_empty());
    }

    #[test]
    fn test_add_predecessor() {
        let mut node = Node::new(1);
        node.add_predecessor(2);
        assert!(node.predecessors().contains(&2));
    }

    #[test]
    fn test_add_successor() {
        let mut node = Node::new(1);
        node.add_successor(2);
        assert!(node.successors().contains(&2));
    }

    #[test]
    fn test_remove_predecessor() {
        let mut node = Node::new(1);
        node.add_predecessor(2);
        node.remove_predecessor(2);
        assert!(!node.predecessors().contains(&2));
    }

    #[test]
    fn test_remove_successor() {
        let mut node = Node::new(1);
        node.add_successor(2);
        node.remove_successor(2);
        assert!(!node.successors().contains(&2));
    }

    #[test]
    fn test_multiple_connections() {
        let mut node = Node::new(1);

        // Add multiple predecessors and successors
        node.add_predecessor(2);
        node.add_predecessor(3);
        node.add_successor(4);
        node.add_successor(5);

        assert_eq!(node.predecessors().len(), 2);
        assert_eq!(node.successors().len(), 2);
        assert!(node.predecessors().contains(&2));
        assert!(node.predecessors().contains(&3));
        assert!(node.successors().contains(&4));
        assert!(node.successors().contains(&5));

        // Remove some connections
        node.remove_predecessor(2);
        node.remove_successor(4);

        assert_eq!(node.predecessors().len(), 1);
        assert_eq!(node.successors().len(), 1);
        assert!(!node.predecessors().contains(&2));
        assert!(node.predecessors().contains(&3));
        assert!(!node.successors().contains(&4));
        assert!(node.successors().contains(&5));
    }

    #[test]
    fn test_duplicate_connections() {
        let mut node = Node::new(1);

        // Adding the same predecessor twice should not duplicate
        node.add_predecessor(2);
        node.add_predecessor(2);
        assert_eq!(node.predecessors().len(), 1);

        // Adding the same successor twice should not duplicate
        node.add_successor(3);
        node.add_successor(3);
        assert_eq!(node.successors().len(), 1);
    }
}