networkit-rs 0.1.0

Rust bindings for Networkit
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

use cxx::UniquePtr;

use crate::bridge::{self, *};
use crate::graph;
use miette::{bail, Result};

pub struct GraphBuilder {
    inner: UniquePtr<bridge::GraphBuilder>,
}

unsafe impl Send for GraphBuilder {}

impl GraphBuilder {
    pub fn new(n: u64, weighted: bool, directed: bool) -> Self {
        Self {
            inner: NewGraphBuilder(n, weighted, directed),
        }
    }
    pub fn complete_graph(&mut self, parallel: bool) -> graph::Graph {
        let g = GraphBuilderCompleteGraph(self.inner.pin_mut(), parallel);
        graph::Graph { inner: g }
    }
    pub fn reset(&mut self, n: u64) {
        self.inner.pin_mut().reset(n);
    }
    pub fn is_weighted(&self) -> bool {
        self.inner.isWeighted()
    }
    pub fn is_directed(&self) -> bool {
        self.inner.isDirected()
    }
    pub fn is_empty(&self) -> bool {
        self.inner.isEmpty()
    }
    pub fn number_of_nodes(&self) -> u64 {
        self.inner.numberOfNodes()
    }
    pub fn upper_node_id_bound(&self) -> u64 {
        self.inner.upperNodeIdBound()
    }
    pub fn add_node(&mut self) -> u64 {
        self.inner.pin_mut().addNode()
    }
    pub unsafe fn add_half_edge_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().addHalfEdge(u, v, ew.unwrap_or(1.))
    }
    pub fn add_half_edge(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.add_half_edge_unchecked(u, v, ew) })
    }
    pub unsafe fn add_half_out_edge_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().addHalfOutEdge(u, v, ew.unwrap_or(1.))
    }
    pub fn add_half_out_edge(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.add_half_out_edge_unchecked(u, v, ew) })
    }
    pub unsafe fn add_half_in_edge_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().addHalfInEdge(u, v, ew.unwrap_or(1.))
    }
    pub fn add_half_in_edge(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.add_half_in_edge_unchecked(u, v, ew) })
    }
    pub unsafe fn set_weight_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().setWeight(u, v, ew.unwrap_or(1.))
    }
    pub fn set_weight(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.set_weight_unchecked(u, v, ew) })
    }
    pub unsafe fn set_out_weight_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().setOutWeight(u, v, ew.unwrap_or(1.))
    }
    pub fn set_out_weight(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.set_out_weight_unchecked(u, v, ew) })
    }
    pub unsafe fn set_in_weight_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().setInWeight(u, v, ew.unwrap_or(1.))
    }
    pub fn set_in_weight(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.set_in_weight_unchecked(u, v, ew) })
    }
    pub unsafe fn increase_weight_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner.pin_mut().increaseWeight(u, v, ew.unwrap_or(1.))
    }
    pub fn increase_weight(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.increase_weight_unchecked(u, v, ew) })
    }
    pub unsafe fn increase_out_weight_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner
            .pin_mut()
            .increaseOutWeight(u, v, ew.unwrap_or(1.))
    }
    pub fn increase_out_weight(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.increase_out_weight_unchecked(u, v, ew) })
    }
    pub unsafe fn increase_in_weight_unchecked(&mut self, u: u64, v: u64, ew: Option<f64>) {
        self.inner
            .pin_mut()
            .increaseInWeight(u, v, ew.unwrap_or(1.))
    }
    pub fn increase_in_weight(&mut self, u: u64, v: u64, ew: Option<f64>) -> Result<()> {
        for n in [u, v] {
            if n >= self.upper_node_id_bound() {
                bail!("Node out of bound: {}", n);
            }
        }
        Ok(unsafe { self.increase_in_weight_unchecked(u, v, ew) })
    }
}