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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188

use crate::async_graph::{AsyncGraphEdgeParams, Bwd, BwdIterator, Fwd, FwdIterator};
use crate::biodivine_std::structs::IdState;
use crate::biodivine_std::traits::{EvolutionOperator, InvertibleEvolutionOperator};

impl<'a, Params: AsyncGraphEdgeParams> EvolutionOperator for Fwd<'a, Params> {
    type State = IdState;
    type Params = Params::ParamSet;
    type Iterator = FwdIterator<'a, Params>;

    fn step(&self, current: IdState) -> Self::Iterator {
        return FwdIterator {
            graph: self.graph,
            variables: self.graph.network().graph.variables(),
            state: current,
        };
    }
}

impl<'a, Params: AsyncGraphEdgeParams> InvertibleEvolutionOperator for Fwd<'a, Params> {
    type InvertedOperator = Bwd<'a, Params>;

    fn invert(&self) -> Self::InvertedOperator {
        Bwd { graph: self.graph }
    }
}

impl<Params: AsyncGraphEdgeParams> Iterator for FwdIterator<'_, Params> {
    type Item = (IdState, Params::ParamSet);

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(var) = self.variables.next() {
            let target = self.state.flip_bit(var.0);
            let edge_params = self.graph.edges.edge_params(self.state, var);
            Some((target, edge_params))
        } else {
            None
        }
    }
}

impl<'a, Params: AsyncGraphEdgeParams> EvolutionOperator for Bwd<'a, Params> {
    type State = IdState;
    type Params = Params::ParamSet;
    type Iterator = BwdIterator<'a, Params>;

    fn step(&self, current: IdState) -> Self::Iterator {
        BwdIterator {
            graph: self.graph,
            variables: self.graph.network().graph.variables(),
            state: current,
        }
    }
}

impl<'a, Params: AsyncGraphEdgeParams> InvertibleEvolutionOperator for Bwd<'a, Params> {
    type InvertedOperator = Fwd<'a, Params>;

    fn invert(&self) -> Self::InvertedOperator {
        Fwd { graph: self.graph }
    }
}

impl<Params: AsyncGraphEdgeParams> Iterator for BwdIterator<'_, Params> {
    type Item = (IdState, Params::ParamSet);

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(var) = self.variables.next() {
            let source = self.state.flip_bit(var.0);
            let edge_params = self.graph.edges.edge_params(source, var);
            Some((source, edge_params))
        } else {
            None
        }
    }
}

#[cfg(test)]
mod tests {
    use crate::async_graph::AsyncGraph;
    use crate::bdd_params::BddParams;
    use crate::biodivine_std::structs::IdState;
    use crate::biodivine_std::traits::{EvolutionOperator, Graph, Set};
    use crate::BooleanNetwork;
    use std::collections::HashSet;
    use std::convert::TryFrom;

    #[test]
    fn test_no_param_network() {
        let network = BooleanNetwork::try_from(
            "
            a -> b
            a -> a
            b -| a
            b -| b
            $a: a & !b
            $b: a | !b
        ",
        )
        .unwrap();
        let graph = &AsyncGraph::new(network).unwrap();

        let edges: HashSet<(IdState, IdState)> = vec![
            (IdState::from(0b00), IdState::from(0b10)),
            (IdState::from(0b10), IdState::from(0b00)),
            (IdState::from(0b00), IdState::from(0b10)),
            (IdState::from(0b01), IdState::from(0b11)),
            (IdState::from(0b11), IdState::from(0b10)),
        ]
        .into_iter()
        .collect();

        let fwd = graph.fwd();
        let bwd = graph.bwd();

        for s in graph.states() {
            for (t, p) in fwd.step(s) {
                assert_eq!(
                    !p.is_empty(),
                    edges.contains(&(s, t)),
                    "Edge ({:?},{:?})",
                    s,
                    t
                );
            }
            for (t, p) in bwd.step(s) {
                assert_eq!(
                    !p.is_empty(),
                    edges.contains(&(t, s)),
                    "Edge ({:?},{:?})",
                    t,
                    s
                );
            }
        }
    }

    #[test]
    fn test_anonymous_param_network() {
        let network = BooleanNetwork::try_from(
            "
            a ->? b
            a -> a
            b -|? a
            b -| b
        ",
        )
        .unwrap();
        let graph = &AsyncGraph::new(network).unwrap();
        let fwd = graph.fwd();
        let bwd = graph.bwd();

        let edges: HashSet<(IdState, IdState, i32)> = vec![
            (IdState::from(0b00), IdState::from(0b10), 2 * 3),
            (IdState::from(0b10), IdState::from(0b00), 3 * 3),
            (IdState::from(0b00), IdState::from(0b01), 1 * 3),
            (IdState::from(0b11), IdState::from(0b10), 1 * 3),
            (IdState::from(0b01), IdState::from(0b11), 3 * 3),
            (IdState::from(0b11), IdState::from(0b01), 2 * 3),
        ]
        .into_iter()
        .collect();

        assert_eq!(9.0, graph.unit_params().cardinality());

        let mut fwd_edges: HashSet<(IdState, IdState, BddParams)> = HashSet::new();
        let mut bwd_edges: HashSet<(IdState, IdState, BddParams)> = HashSet::new();

        for s in graph.states() {
            let successors = fwd.step(s);
            for (t, p) in successors {
                let p = p.intersect(graph.unit_params());
                if p.cardinality() > 0.0 {
                    assert!(edges.contains(&(s, t, p.cardinality() as i32)));
                }
                fwd_edges.insert((s, t, p));
            }
            for (t, p) in bwd.step(s) {
                let p = p.intersect(graph.unit_params());
                if p.cardinality() > 0.0 {
                    assert!(edges.contains(&(t, s, p.cardinality() as i32)));
                }
                bwd_edges.insert((t, s, p));
            }
        }

        assert_eq!(fwd_edges, bwd_edges)
    }
}