archmap 1.0.2

Static architectural analysis of codebases.
Documentation 
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

use crate::analysis::DependencyGraph;
use crate::model::Issue;
use petgraph::algo::tarjan_scc;

pub fn detect_circular_dependencies(graph: &DependencyGraph) -> Vec<Issue> {
    let mut issues = Vec::new();

    // Find strongly connected components
    let sccs = tarjan_scc(graph.graph());

    for scc in sccs {
        // A cycle exists if SCC has more than one node, or a single node with self-loop
        if scc.len() > 1 {
            let cycle: Vec<_> = scc
                .iter()
                .filter_map(|idx| graph.graph().node_weight(*idx).cloned())
                .collect();

            if !cycle.is_empty() {
                issues.push(Issue::circular_dependency(cycle));
            }
        } else if scc.len() == 1 {
            // Check for self-loop
            let idx = scc[0];
            if graph
                .graph()
                .neighbors_directed(idx, petgraph::Direction::Outgoing)
                .any(|n| n == idx)
            {
                if let Some(path) = graph.graph().node_weight(idx) {
                    issues.push(Issue::circular_dependency(vec![path.clone()]));
                }
            }
        }
    }

    issues
}