reflow_graph 0.2.1

Graph data structures for Reflow — nodes, edges, IIPs, exports, and analysis.
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130

use criterion::{criterion_group, criterion_main, Criterion};
use reflow_graph::Graph;

pub fn benchmark_graph_operations(c: &mut Criterion) {
    // Node Operations Benchmark
    c.bench_function("add_1000_nodes", |b| {
        b.iter(|| {
            let mut graph = Graph::new("test", false, None);
            for i in 0..1000 {
                graph.add_node(&format!("node_{}", i), "test", None);
            }
        });
    });

    // Connection Operations Benchmark
    c.bench_function("add_1000_connections", |b| {
        b.iter(|| {
            let mut graph = Graph::new("test", false, None);
            // Setup nodes first
            for i in 0..100 {
                graph.add_node(&format!("node_{}", i), "test", None);
            }
            // Add connections
            for i in 0..99 {
                graph.add_connection(
                    &format!("node_{}", i),
                    "out",
                    &format!("node_{}", i + 1),
                    "in",
                    None,
                );
            }
        });
    });

    // Group Operations Benchmark
    c.bench_function("group_operations", |b| {
        b.iter(|| {
            let mut graph = Graph::new("test", false, None);
            // Setup nodes
            for i in 0..100 {
                graph.add_node(&format!("node_{}", i), "test", None);
            }
            // Create groups and add nodes
            for i in 0..10 {
                let nodes = (0..10)
                    .map(|j| format!("node_{}", i * 10 + j))
                    .collect::<Vec<_>>();
                graph.add_group(&format!("group_{}", i), nodes, None);
            }
        });
    });

    // Mixed Operations Benchmark
    c.bench_function("mixed_operations", |b| {
        b.iter(|| {
            let mut graph = Graph::new("test", false, None);
            // Add nodes
            for i in 0..100 {
                graph.add_node(&format!("node_{}", i), "test", None);
            }
            // Add connections
            for i in 0..99 {
                graph.add_connection(
                    &format!("node_{}", i),
                    "out",
                    &format!("node_{}", i + 1),
                    "in",
                    None,
                );
            }
            // Remove some nodes
            for i in 0..10 {
                graph.remove_node(&format!("node_{}", i * 5));
            }
            // Add groups
            let nodes = (0..5)
                .map(|i| format!("node_{}", i * 10))
                .collect::<Vec<_>>();
            graph.add_group("test_group", nodes, None);
        });
    });

    c.bench_function("dfs_1000_nodes", |b| {
        b.iter(|| {
            let mut graph = Graph::new("test", false, None);
            // Setup nodes first
            for i in 0..100 {
                graph.add_node(&format!("node_{}", i), "test", None);
            }
            // Add connections
            for i in 0..99 {
                graph.add_connection(
                    &format!("node_{}", i),
                    "out",
                    &format!("node_{}", i + 1),
                    "in",
                    None,
                );
            }

            let _ = graph.traverse_depth_first("node_10", |_| {});
        });
    });

    c.bench_function("bfs_1000_nodes", |b| {
        b.iter(|| {
            let mut graph = Graph::new("test", false, None);
            // Setup nodes first
            for i in 0..100 {
                graph.add_node(&format!("node_{}", i), "test", None);
            }
            // Add connections
            for i in 0..99 {
                graph.add_connection(
                    &format!("node_{}", i),
                    "out",
                    &format!("node_{}", i + 1),
                    "in",
                    None,
                );
            }

            let _ = graph.traverse_breadth_first("node_20", |_| {});
        });
    });
}

criterion_group!(benches, benchmark_graph_operations);
criterion_main!(benches);