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
use crate::{
graph::{PackageGraph, PackageIx},
petgraph_support::scc::Sccs,
Error, PackageId,
};
pub struct Cycles<'g> {
package_graph: &'g PackageGraph,
sccs: &'g Sccs<PackageIx>,
}
impl<'g> Cycles<'g> {
pub(super) fn new(package_graph: &'g PackageGraph) -> Self {
Self {
package_graph,
sccs: package_graph.sccs(),
}
}
pub fn is_cyclic(&self, a: &PackageId, b: &PackageId) -> Result<bool, Error> {
let a_ix = self.package_graph.package_ix(a)?;
let b_ix = self.package_graph.package_ix(b)?;
Ok(self.sccs.is_same_scc(a_ix, b_ix))
}
pub fn all_cycles(
&self,
) -> impl Iterator<Item = Vec<&'g PackageId>> + DoubleEndedIterator + 'g {
let dep_graph = &self.package_graph.dep_graph;
self.sccs
.multi_sccs()
.map(move |scc| scc.iter().map(move |ix| &dep_graph[*ix]).collect())
}
}