para-graph 0.1.2

"Para-Graph" delivers swift, parallel graph algorithms in Rust, optimized for CPU and GPU. Ideal for HPC workflows.
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

use petgraph::prelude::NodeIndex;

#[derive(Default, Debug, Copy, Clone)]
pub struct Task {
    /// Number of bits
    pub data_size: u64,
    /// Average of necessary cycles per bit
    pub processing_density: f64,
    /// Percent of computing that can be parallelized
    pub parallel_fraction: f64,
    /// Node on topology this task is forced to be present
    pub pin: Option<NodeIndex>,
}

impl Task {
    pub fn empty() -> Self {
        Self::default()
    }

    pub fn with_pin(mut self, node: NodeIndex) -> Self {
        self.pin = Some(node);
        self
    }
}

impl std::fmt::Display for Task {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.write_fmt(format_args!("{:?}", self))
    }
}

#[derive(Debug, Copy, Clone)]
pub struct Dependency {
    /// Number of bits
    pub data_size: u64,
}

impl Dependency {
    pub fn new(data_size: u64) -> Self {
        Self { data_size }
    }
}

impl std::fmt::Display for Dependency {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.write_fmt(format_args!("{}b", self.data_size))
    }
}