idtree 0.3.1

ID-Tree dynamic connectivity data structure
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172

// bench_cpp_idtree.rs
// cargo bench --features cpp
mod common;

use std::time::Instant;

use crate::common::BenchData;
use crate::common::Task;
use crate::common::TaskVariant;
use crate::common::report;

const USE_DSU: bool = false;

const TASKS: [Task; 1] = [Task {
    variant: TaskVariant::CPPIDTree,
}];

// MARK: Data Preparation

#[cfg(feature = "cpp")]
fn setup_cpp_tree(
    n: usize,
    edges: &[(usize, usize)],
) -> cxx::UniquePtr<idtree::bridge::ffi::CPPDNDTree> {
    use idtree::bridge::ffi;

    let mut adj = vec![vec![]; n];
    for &(u, v) in edges {
        if u < n && v < n {
            adj[u as usize].push(v);
            adj[v as usize].push(u);
        }
    }

    let mut degrees = Vec::with_capacity(n);
    let mut flat_neighbors = Vec::new();
    for neighbors in &adj {
        degrees.push(neighbors.len() as i32);
        for &v in neighbors {
            flat_neighbors.push(v as i32);
        }
    }

    ffi::new_cpp_dndtree_from_flat_adj(n as i32, &degrees, &flat_neighbors, USE_DSU)
}

// MARK: Benchmarks

#[cfg(feature = "cpp")]
fn trace_creation(data: &BenchData) -> Vec<(i32, usize)> {
    let mut trace = Vec::with_capacity(data.edges.len());

    let time = Instant::now();
    let _tree = setup_cpp_tree(data.n, &[]);
    let elapsed = time.elapsed().as_nanos() as usize;
    trace.push((2, elapsed));

    trace
}

#[cfg(feature = "cpp")]
fn trace_insertion(data: &BenchData) -> Vec<(i32, usize)> {
    let tree = setup_cpp_tree(data.n, &[]);
    let mut trace = Vec::with_capacity(data.edges.len());

    for &(u, v) in data.edges.iter() {
        let time = Instant::now();
        let res = tree.insert_edge(u as i32, v as i32);
        let elapsed = time.elapsed().as_nanos() as usize;
        trace.push((res, elapsed));
    }

    trace
}

#[cfg(feature = "cpp")]
fn trace_query_cold(data: &BenchData) -> Vec<(i32, usize)> {
    let tree = setup_cpp_tree(data.n, &data.edges);
    let mut trace = Vec::with_capacity(data.edges.len());

    for &(u, v) in data.del_edges.iter() {
        tree.delete_edge(u as i32, v as i32);
    }

    for &(u, v) in data.query_edges.iter() {
        let time = Instant::now();
        let res = tree.query(u as i32, v as i32);
        let elapsed = time.elapsed().as_nanos() as usize;
        trace.push((res as i32, elapsed));
    }

    trace
}

#[cfg(feature = "cpp")]
fn trace_query_warm(data: &BenchData) -> Vec<(i32, usize)> {
    let tree = setup_cpp_tree(data.n, &data.edges);
    for &(u, v) in data.del_edges.iter() {
        tree.delete_edge(u as i32, v as i32);
    }

    // run through one time to warm up
    for &(u, v) in data.query_edges.iter() {
        tree.query(u as i32, v as i32);
    }

    let mut trace = Vec::with_capacity(data.query_edges.len());

    for &(u, v) in data.query_edges.iter() {
        let time = Instant::now();
        let res = tree.query(u as i32, v as i32);
        let elapsed = time.elapsed().as_nanos() as usize;
        trace.push((res as i32, elapsed));
    }

    trace
}

#[cfg(feature = "cpp")]
fn trace_delete(data: &BenchData) -> Vec<(i32, usize)> {
    let tree = setup_cpp_tree(data.n, &data.edges);
    let mut trace = Vec::with_capacity(data.edges.len());

    for &(u, v) in data.edges.iter() {
        let time = Instant::now();
        let res = tree.delete_edge(u as i32, v as i32);
        let elapsed = time.elapsed().as_nanos() as usize;
        trace.push((res as i32, elapsed));
    }

    trace
}

#[cfg(feature = "cpp")]
fn bench_task(task: Task, data: &BenchData, sample_count: u32) {
    let mut sample_data = Vec::with_capacity(sample_count as usize);
    for _ in 0..sample_count {
        let traces = vec![
            trace_creation(data),
            trace_insertion(data),
            trace_query_cold(data),
            trace_query_warm(data),
            trace_delete(data),
        ];
        sample_data.push(traces);
    }
    report(task, sample_data);
}

#[cfg(feature = "cpp")]
fn main() {
    println!("\nPreparing road-usroads-48.mtx data...");
    let start_time = Instant::now();
    let bench_data = BenchData::new("road-usroads-48.mtx");
    println!("Prepared in {} ms", start_time.elapsed().as_millis());

    for task in TASKS {
        bench_task(task, &bench_data, 10);
    }

    println!("\nPreparing bdo_exploration_graph.mtx data...");
    let start_time = Instant::now();
    let bench_data = BenchData::new("bdo_exploration_graph.mtx");
    println!("Prepared in {} ms", start_time.elapsed().as_millis());

    for task in TASKS {
        bench_task(task, &bench_data, 1000);
    }
}

#[cfg(not(feature = "cpp"))]
fn main() {}