Add find_shortest_cycle to rust graph

Author: Peter554

rust/src/graph/cycles.rs

@@ -0,0 +1,29 @@
+use crate::errors::GrimpResult;
+use crate::graph::pathfinding;
+use crate::graph::{ExtendWithDescendants, Graph, ModuleToken};
+use rustc_hash::{FxHashMap, FxHashSet};
+use tap::Conv;
+
+impl Graph {
+    pub fn find_shortest_cycle(
+        &self,
+        module: ModuleToken,
+        as_package: bool,
+    ) -> GrimpResult<Option<Vec<ModuleToken>>> {
+        if as_package {
+            pathfinding::find_shortest_cycle(
+                self,
+                &module.conv::<FxHashSet<_>>().with_descendants(self),
+                &FxHashSet::default(),
+                &FxHashMap::default(),
+            )
+        } else {
+            pathfinding::find_shortest_cycle(
+                self,
+                &module.conv::<FxHashSet<_>>(),
+                &FxHashSet::default(),
+                &FxHashMap::default(),
+            )
+        }
+    }
+}

rust/src/graph/mod.rs

@@ -8,6 +8,7 @@ use std::sync::RwLock;
 use string_interner::backend::StringBackend;
 use string_interner::{DefaultSymbol, StringInterner};
 
+pub mod cycles;
 pub mod direct_import_queries;
 pub mod graph_manipulation;
 pub mod hierarchy_queries;

rust/src/lib.rs

@@ -353,6 +353,25 @@ impl GraphWrapper {
         PySet::new(py, chains)
     }
 
+    #[pyo3(signature = (module, as_package=false))]
+    pub fn find_shortest_cycle(
+        &self,
+        module: &str,
+        as_package: bool,
+    ) -> PyResult<Option<Vec<String>>> {
+        let module = self.get_visible_module_by_name(module)?.token();
+        Ok(self
+            ._graph
+            .find_shortest_cycle(module, as_package)?
+            .map(|chain| {
+                chain
+                    .iter()
+                    .into_module_iterator(&self._graph)
+                    .names()
+                    .collect()
+            }))
+    }
+
     #[pyo3(signature = (layers, containers))]
     pub fn find_illegal_dependencies_for_layers<'py>(
         &self,