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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
use crate::quiver_algebra::Quiver;
impl<VertexLabel, EdgeLabel> Quiver<VertexLabel, EdgeLabel>
where
VertexLabel: std::hash::Hash + Eq + Clone,
EdgeLabel: std::hash::Hash + Eq + Clone,
{
/// Construct the quiver of type `A_n` with the specified vertex labels and edge labels.
/// This is a default orientation.
///
/// The edge labels should be provided in the following order
/// `e_01, e_12, e_23, ..., e_{n-2,n-1}`
/// The edge `e_ij` goes from vertex `vertex_names[i]` to vertex `vertex_names[j]`
#[allow(clippy::missing_panics_doc)]
pub fn make_a_n<const N: usize>(
vertex_names: &[VertexLabel; N],
mut edge_label: impl Iterator<Item = EdgeLabel>,
) -> Self {
let mut to_return = Quiver::new();
for v in vertex_names {
to_return.add_vertex(v.clone());
}
for (idx, v) in vertex_names.iter().enumerate() {
if idx + 1 < vertex_names.len() {
to_return.add_edge(
v.clone(),
vertex_names[idx + 1].clone(),
edge_label
.next()
.expect("Should have provided N-1 edge labels"),
);
}
}
assert_eq!(
edge_label.count(),
0,
"Should have provided N-1 edge labels"
);
to_return
}
/// Construct the quiver of type `D_n` with the specified vertex labels and edge labels.
/// This is a default orientation.
///
/// The edge labels should be provided in the following order
/// `e_01, e_12, e_23, ..., e_{n-3,n-2}, e_{n-3,n-1}`
/// The edge `e_ij` goes from vertex `vertex_names[i]` to vertex `vertex_names[j]`
#[allow(clippy::missing_panics_doc)]
pub fn make_d_n<const N: usize>(
vertex_names: &[VertexLabel; N],
mut edge_label: impl Iterator<Item = EdgeLabel>,
) -> Self {
let mut to_return = Quiver::new();
for v in vertex_names {
to_return.add_vertex(v.clone());
}
for (idx, v) in vertex_names.iter().enumerate() {
if idx + 3 < vertex_names.len() {
to_return.add_edge(
v.clone(),
vertex_names[idx + 1].clone(),
edge_label
.next()
.expect("Should have provided N-1 edge labels"),
);
}
if idx + 3 == vertex_names.len() {
to_return.add_edge(
v.clone(),
vertex_names[idx + 1].clone(),
edge_label
.next()
.expect("Should have provided N-1 edge labels"),
);
to_return.add_edge(
v.clone(),
vertex_names[idx + 2].clone(),
edge_label
.next()
.expect("Should have provided N-1 edge labels"),
);
}
}
assert_eq!(
edge_label.count(),
0,
"Should have provided N-1 edge labels"
);
to_return
}
/// Construct the quiver of type `B_n` or `C_n` with the specified vertex labels and edge labels.
/// This is a default orientation.
///
/// The edge labels should be provided in the following order
/// `e_01, e_12, e_23, ..., e_{n-3,n-2}, e_{n-2,n-1}, e_{n-2,n-1}'` for type B
/// `e_01, e_12, e_23, ..., e_{n-3,n-2}, e_{n-1,n-2}, e_{n-1,n-2}'` for type C
/// The edge `e_ij` goes from vertex `vertex_names[i]` to vertex `vertex_names[j]`
#[allow(clippy::missing_panics_doc)]
pub fn make_bc_n<const N: usize>(
type_b: bool,
vertex_names: &[VertexLabel; N],
mut edge_label: impl Iterator<Item = EdgeLabel>,
) -> Self {
let mut to_return = Quiver::new();
for v in vertex_names {
to_return.add_vertex(v.clone());
}
for (idx, v) in vertex_names.iter().enumerate() {
if idx + 2 < vertex_names.len() {
to_return.add_edge(
v.clone(),
vertex_names[idx + 1].clone(),
edge_label
.next()
.expect("Should have provided N edge labels"),
);
} else if idx + 2 == vertex_names.len() {
if type_b {
to_return.add_edge(
v.clone(),
vertex_names[idx + 1].clone(),
edge_label
.next()
.expect("Should have provided N edge labels"),
);
to_return.add_edge(
v.clone(),
vertex_names[idx + 1].clone(),
edge_label
.next()
.expect("Should have provided N edge labels"),
);
} else {
to_return.add_edge(
vertex_names[idx + 1].clone(),
v.clone(),
edge_label
.next()
.expect("Should have provided N edge labels"),
);
to_return.add_edge(
vertex_names[idx + 1].clone(),
v.clone(),
edge_label
.next()
.expect("Should have provided N edge labels"),
);
}
}
}
assert_eq!(edge_label.count(), 0, "Should have provided N edge labels");
to_return
}
}
#[cfg(test)]
mod tests {
use crate::quiver_algebra::make_a2_quiver;
use super::*;
#[test]
fn a2_match() {
let quiver = Quiver::make_a_n(&["alpha", "beta"], ["a"].into_iter());
let make_a2_alt = make_a2_quiver();
assert!(quiver == make_a2_alt);
}
#[test]
fn make_d5() {
let quiver = Quiver::make_d_n(
&["v1", "v2", "v3", "v4", "v5"],
["e12", "e23", "e34", "e35"].into_iter(),
);
let mut quiver_vs = quiver
.vertex_labels()
.map(ToString::to_string)
.collect::<Vec<_>>();
quiver_vs.sort_unstable();
assert_eq!(quiver_vs, ["v1", "v2", "v3", "v4", "v5"]);
let mut quiver_es = quiver
.edge_labels()
.map(ToString::to_string)
.collect::<Vec<_>>();
quiver_es.sort_unstable();
assert_eq!(quiver_es, ["e12", "e23", "e34", "e35"]);
assert_eq!(
quiver.edge_endpoint_labels(&"e12"),
Some(("v1".into(), "v2".into()))
);
assert_eq!(
quiver.edge_endpoint_labels(&"e23"),
Some(("v2".into(), "v3".into()))
);
assert_eq!(
quiver.edge_endpoint_labels(&"e34"),
Some(("v3".into(), "v4".into()))
);
assert_eq!(
quiver.edge_endpoint_labels(&"e35"),
Some(("v3".into(), "v5".into()))
);
}
}