differt-core 0.0.14__tar.gz → 0.0.16__tar.gz

{differt_core-0.0.14 → differt_core-0.0.16}/Cargo.lock

@@ -238,7 +238,7 @@ checksum = "7a81dae078cea95a014a339291cec439d2f232ebe854a9d672b796c6afafa9b7"
 
 [[package]]
 name = "differt-core"
-version = "0.0.14"
+version = "0.0.16"
 dependencies = [
  "criterion",
  "log",

{differt_core-0.0.14 → differt_core-0.0.16}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: differt-core
-Version: 0.0.14
+Version: 0.0.16
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10

{differt_core-0.0.14 → differt_core-0.0.16}/differt-core/Cargo.toml

@@ -32,4 +32,4 @@ name = "differt_core"
 edition = "2021"
 name = "differt-core"
 rust-version = "1.75.0"
-version = "0.0.14"
+version = "0.0.16"

{differt_core-0.0.14 → differt_core-0.0.16}/differt-core/src/rt/graph.rs

@@ -117,6 +117,9 @@ pub mod complete {
     /// A complete graph, i.e.,
     /// a simple undirected graph in which every pair of
     /// distinc nodes is connected by a unique edge.
+    ///
+    /// Args:
+    ///     num_nodes (int): The number of nodes.
     #[pyclass]
     #[derive(Clone, Debug)]
     pub struct CompleteGraph {
@@ -547,6 +550,12 @@ pub mod directed {
     }
 
     impl DiGraph {
+        #[inline]
+        pub fn empty(num_nodes: usize) -> Self {
+            Self {
+                edges_list: vec![vec![]; num_nodes],
+            }
+        }
         #[inline]
         pub fn get_adjacent_nodes(&self, node: NodeId) -> &[NodeId] {
             self.edges_list[node].as_ref()
@@ -574,6 +583,23 @@ pub mod directed {
 
     #[pymethods]
     impl DiGraph {
+        /// Create an edgeless directed graph with ``num_nodes`` nodes.
+        ///
+        /// This is equivalent to creating a directed graph from
+        /// an adjacency matrix will all entries equal to :py:data:`False`.
+        ///
+        /// Args:
+        ///     num\_nodes (int): The number of nodes.
+        ///
+        /// Return:
+        ///     DiGraph: A directed graph.
+        #[classmethod]
+        #[pyo3(name = "empty")]
+        #[pyo3(text_signature = "(cls, num_nodes)")]
+        fn py_empty(_: Bound<'_, PyType>, num_nodes: usize) -> Self {
+            Self::empty(num_nodes)
+        }
+
         /// Create a directed graph from an adjacency matrix.
         ///
         /// Each row of the adjacency matrix ``M`` contains boolean
@@ -1111,6 +1137,16 @@ mod tests {
         assert_eq!(got, expected);
     }
 
+    #[rstest]
+    #[case(9, 2)]
+    #[case(3, 3)]
+    fn test_empty_di_graph_returns_all_paths(#[case] num_nodes: usize, #[case] depth: usize) {
+        let mut graph = DiGraph::empty(num_nodes);
+        let (from, to) = graph.insert_from_and_to_nodes(false);
+
+        assert_eq!(graph.all_paths(from, to, depth + 2, true).count(), 0);
+    }
+
     #[rstest]
     #[case(9, 2)]
     #[case(3, 3)]