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
use crate::combinatorics::*;
use crate::common::*;
use crate::flag::Flag;
use canonical_form::Canonize;
use serde::de::DeserializeOwned;
use serde::Serialize;
use std::fmt;
use std::fmt::Display;
#[derive(PartialEq, Eq, PartialOrd, Ord, Debug, Clone, Serialize, Deserialize)]
pub struct Model<A> {
size: usize,
pub rel: A,
}
impl<A> Display for Model<A> {
fn fmt(&self, _f: &mut fmt::Formatter) -> fmt::Result {
unimplemented!()
}
}
impl<R> Canonize for Model<R>
where
R: BinRelation + Serialize + DeserializeOwned,
{
fn size(&self) -> usize {
self.size
}
fn invariant_neighborhood(&self, v: usize) -> Vec<Vec<usize>> {
assert!(v < self.size);
self.rel.invariant(v)
}
fn apply_morphism(&self, p: &[usize]) -> Self {
self.induce(&invert(p))
}
}
impl<R> Flag for Model<R>
where
R: BinRelation + Serialize + DeserializeOwned,
{
fn induce(&self, p: &[usize]) -> Self {
Self {
size: p.len(),
rel: self.rel.induce(p),
}
}
const NAME: &'static str = "Model";
fn all_flags(n: usize) -> Vec<Self> {
if n == 0 {
vec![Self {
size: 0,
rel: R::empty(),
}]
} else {
unimplemented!()
}
}
fn superflags(&self) -> Vec<Self> {
let size = self.size;
self.rel
.extensions(size)
.into_iter()
.map(|rel| Self {
size: size + 1,
rel,
})
.collect()
}
}
pub type G = Model<SymNonRefl<bool>>;
#[cfg(test)]
mod tests {
use super::*;
type G = Model<SymNonRefl<bool>>;
#[test]
fn graph_model() {
for (size, &nb) in [1, 1, 2, 4, 11, 34].iter().enumerate() {
assert_eq!(G::generate(size).len(), nb);
}
}
}