Function detect_cycles 

pub fn detect_cycles(
    graph: &KnowledgeGraph,
    max_cycles: usize,
) -> Vec<DependencyCycle>

Detect dependency cycles using Tarjan’s algorithm for strongly connected components.

Only considers directional edges (imports, uses, calls) to find true dependency cycles. Returns cycles sorted by severity (shorter cycles = more severe).