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
use crate::{
graph::{
feature::{FeatureGraph, FeatureId},
FeatureIx,
},
petgraph_support::scc::Sccs,
Error,
};
pub struct Cycles<'g> {
feature_graph: FeatureGraph<'g>,
sccs: &'g Sccs<FeatureIx>,
}
impl<'g> Cycles<'g> {
pub(super) fn new(feature_graph: FeatureGraph<'g>) -> Self {
Self {
feature_graph,
sccs: feature_graph.sccs(),
}
}
pub fn is_cyclic<'a>(
&self,
a: impl Into<FeatureId<'a>>,
b: impl Into<FeatureId<'a>>,
) -> Result<bool, Error> {
let a = a.into();
let b = b.into();
let a_ix = self.feature_graph.feature_ix(a)?;
let b_ix = self.feature_graph.feature_ix(b)?;
Ok(self.sccs.is_same_scc(a_ix, b_ix))
}
pub fn all_cycles(&self) -> impl Iterator<Item = Vec<FeatureId<'g>>> + 'g {
let dep_graph = self.feature_graph.dep_graph();
let package_graph = self.feature_graph.package_graph;
self.sccs.multi_sccs().map(move |class| {
class
.iter()
.map(move |feature_ix| FeatureId::from_node(package_graph, &dep_graph[*feature_ix]))
.collect()
})
}
}