rustworkx-core 0.17.1

Rust APIs used for rustworkx algorithms
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
39
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);
}