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
|
use crate::Graph;
pub fn theorem3_1(g: &Graph) -> bool {
let claw = Graph {
size: 4,
matrix: vec![
vec![0, 1, 1, 1],
vec![1, 0, 0, 0],
vec![1, 0, 0, 0],
vec![1, 0, 0, 0],
],
};
let z1 = Graph {
size: 4,
matrix: vec![
vec![0, 1, 0, 0],
vec![1, 0, 1, 1],
vec![0, 1, 0, 1],
vec![0, 1, 1, 0],
],
};
let forbidden = vec![claw, z1];
return g.is_2_connected() && g.is_free_of(&forbidden);
}
|
