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
use params::IntoOwned;
use prelude::*;
pub trait Sets {
fn vertices_complement<I>(&self, vertices: I) -> VerticesComplement<Self>
where
Self: VertexList + WithVertexProp<bool>,
I: IntoIterator,
I::Item: IntoOwned<Vertex<Self>>,
{
let mut set = self.default_vertex_prop(false);
set.set_values(vertices, true);
VerticesComplement {
vertices: self.vertices(),
set,
}
}
fn edges_complement<I>(&self, edges: I) -> EdgesComplement<Self>
where
Self: EdgeList + WithEdgeProp<bool>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>,
{
let mut set = self.default_edge_prop(false);
set.set_values(edges, true);
EdgesComplement {
edges: self.edges(),
set,
}
}
fn independent_vertex_set_from_iter<I>(
&self,
vertices: I,
) -> IndependentVertexSetFromIter<Self, I::IntoIter>
where
Self: Adjacency + WithVertexProp<bool>,
I: IntoIterator,
I::Item: IntoOwned<Vertex<Self>>,
{
IndependentVertexSetFromIter {
g: self,
vertices: vertices.into_iter(),
marked: self.default_vertex_prop(false),
}
}
fn is_independent_vertex_set<I>(&self, vertices: I) -> bool
where
Self: Adjacency + WithVertexProp<bool>,
I: IntoIterator,
I::Item: IntoOwned<Vertex<Self>>,
{
let mut marked = self.default_vertex_prop(false);
for v in vertices {
let v = v.into_owned();
if marked[v] {
return false;
}
marked.set_values(self.out_neighbors(v), true);
}
true
}
}
impl<G> Sets for G {}
pub struct VerticesComplement<'a, G>
where
G: 'a + WithVertex + WithVertexProp<bool>,
{
vertices: VertexIter<'a, G>,
set: DefaultVertexPropMut<G, bool>,
}
impl<'a, G> Iterator for VerticesComplement<'a, G>
where
G: 'a + WithVertex + WithVertexProp<bool>,
{
type Item = Vertex<G>;
fn next(&mut self) -> Option<Self::Item> {
for e in self.vertices.by_ref() {
if !self.set[e] {
return Some(e);
}
}
None
}
}
pub struct EdgesComplement<'a, G>
where
G: 'a + WithEdge + WithEdgeProp<bool>,
{
edges: EdgeIter<'a, G>,
set: DefaultEdgePropMut<G, bool>,
}
impl<'a, G> Iterator for EdgesComplement<'a, G>
where
G: 'a + WithEdge + WithEdgeProp<bool>,
{
type Item = Edge<G>;
fn next(&mut self) -> Option<Self::Item> {
for e in self.edges.by_ref() {
if !self.set[e] {
return Some(e);
}
}
None
}
}
pub struct IndependentVertexSetFromIter<'a, G, I>
where
G: 'a + Adjacency + WithVertexProp<bool>,
{
g: &'a G,
vertices: I,
marked: DefaultVertexPropMut<G, bool>,
}
impl<'a, G, I> Iterator for IndependentVertexSetFromIter<'a, G, I>
where
G: 'a + Adjacency + WithVertexProp<bool>,
I: Iterator,
I::Item: IntoOwned<Vertex<G>>,
{
type Item = Vertex<G>;
fn next(&mut self) -> Option<Self::Item> {
for v in self.vertices.by_ref() {
let v = v.into_owned();
if self.marked[v] {
continue;
}
self.marked[v] = true;
self.marked.set_values(self.g.out_neighbors(v), true);
return Some(v);
}
None
}
}