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
use itertools::Itertools;
use std::collections::{HashMap, HashSet};
use std::hash::Hash;
use std::iter::once;
use std::usize;
fn get_and_redirect(table: &mut Vec<usize>, idx: usize) -> usize {
let r = table[idx];
if idx == r {
idx
} else {
let r = get_and_redirect(table, r);
table[idx] = r;
r
}
}
pub fn separate_components<N>(groups: &[Vec<N>]) -> (HashMap<N, usize>, Vec<usize>)
where
N: Clone + Hash + Eq,
{
let mut table = Vec::new();
let mut indices = HashMap::new();
let mut gindices = Vec::with_capacity(groups.len());
for g in groups {
let idxs = g.iter()
.map(|n| {
indices
.get(n)
.map(|&i| get_and_redirect(&mut table, i))
.unwrap_or_else(|| {
let l = table.len();
indices.insert(n, l);
table.push(l);
l
})
})
.collect_vec();
let &idx = idxs.iter().min().unwrap_or(&usize::MAX);
for i in idxs {
if i != idx {
table[i] = idx;
}
}
gindices.push(idx);
}
(
indices
.into_iter()
.map(|(n, i)| (n.clone(), get_and_redirect(&mut table, i)))
.collect(),
gindices
.into_iter()
.map(|i| {
if i == usize::MAX {
i
} else {
get_and_redirect(&mut table, i)
}
})
.collect(),
)
}
pub fn components<N>(groups: &[Vec<N>]) -> Vec<HashSet<N>>
where
N: Clone + Hash + Eq,
{
let (_, gindices) = separate_components(groups);
let gb = gindices
.into_iter()
.enumerate()
.filter(|&(_, n)| n != usize::MAX)
.sorted_by(|&(_, n1), &(_, n2)| Ord::cmp(&n1, &n2))
.into_iter()
.group_by(|&(_, n)| n);
gb.into_iter()
.map(|(_, gs)| {
gs.into_iter()
.map(|(i, _)| groups[i].clone())
.flatten()
.collect::<HashSet<_>>()
})
.collect()
}
pub fn connected_components<N, FN, IN>(starts: &[N], mut neighbours: FN) -> Vec<HashSet<N>>
where
N: Clone + Hash + Eq,
FN: FnMut(&N) -> IN,
IN: IntoIterator<Item = N>,
{
components(&starts
.iter()
.map(|s| {
neighbours(s)
.into_iter()
.chain(once(s.clone()))
.collect_vec()
})
.collect_vec())
}
#[cfg_attr(feature = "cargo-clippy", allow(implicit_hasher))]
pub fn component_index<N>(components: &[HashSet<N>]) -> HashMap<N, usize>
where
N: Clone + Hash + Eq,
{
let mut assoc = HashMap::with_capacity(components.len());
for (i, c) in components.iter().enumerate() {
for n in c {
assoc.insert(n.clone(), i);
}
}
assoc
}