Adding Quickcheck full rary graph (#1468)

* Adding quickcheck for barbell graphs

This QuickCheck test verifies structural properties of barbell_graph.

It ensures the total number of nodes is 2 × mesh_size + path_size.

It checks the number of edges matches the expected sum of two cliques, path edges, and connectors.

* Adding quickcheck for full rary tree

We add quickcheck to test the following properties of a full rary tree graph:

Node count is exactly num_nodes

Edge count is at most num_nodes - 1 (a tree has n-1 edges)

* Adding quickcheck test for full rary tree graph

The quickcheck tests for the following properties:

Node count is exactly num_nodes.

Edge count is at most num_nodes - 1 (a tree has n-1 edges).

Author: Krishn1412

rustworkx-core/tests/quickcheck/full_rary_tree_graph.rs

@@ -0,0 +1,40 @@
+use petgraph::graph::UnGraph;
+use quickcheck::{quickcheck, TestResult};
+use rustworkx_core::generators::full_rary_tree_graph;
+
+#[test]
+fn prop_full_rary_tree_structure() {
+    fn prop(branching: usize, num_nodes: usize) -> TestResult {
+        let branching = branching % 10 + 1;
+        let num_nodes = num_nodes % 100;
+
+        if num_nodes == 0 {
+            return TestResult::discard();
+        }
+
+        let graph = match full_rary_tree_graph::<UnGraph<(), ()>, (), _, _, ()>(
+            branching,
+            num_nodes,
+            None,
+            || (),
+            || (),
+        ) {
+            Ok(g) => g,
+            Err(_) => return TestResult::error("Unexpected error in tree generation"),
+        };
+
+        // Property 1: Node count must match
+        if graph.node_count() != num_nodes {
+            return TestResult::failed();
+        }
+
+        // Property 2: Edge count must be exactly n - 1
+        if graph.edge_count() != num_nodes - 1 {
+            return TestResult::failed();
+        }
+
+        TestResult::passed()
+    }
+
+    quickcheck(prop as fn(usize, usize) -> TestResult);
+}

rustworkx-core/tests/quickcheck/main.rs

@@ -1,3 +1,4 @@
 mod barbell_graph;
+mod full_rary_tree_graph;
 mod grid_graph;
 mod lollipop_graph;