idtree 0.2.0

ID-Tree dynamic connectivity data structure
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

// dndtree_wrapper.h

#pragma once
#include <memory>
#include "dndtree.h"
#include "rust/cxx.h"

void set_cpp_trace(bool enable);

class CPPDNDTree {
public:
    std::unique_ptr<DNDTree> inner;

    int insert_edge(int u, int v) const;
    int delete_edge(int u, int v) const;
    bool query(int u, int v) const;
    int get_dsu_root(int u) const;
    int get_tree_parent(int u) const;
    int get_subtree_size(int u) const;
};

// This declaration must be visible to the bridge
std::unique_ptr<CPPDNDTree> new_cpp_dndtree_from_flat_adj(
    int32_t n_nodes,
    rust::Slice<const int32_t> degrees,
    rust::Slice<const int32_t> flat_neighbors,
    bool use_union_find
);