bitdag 0.1.4

A crate to deconstruct the hierrachie of a DAG into a Bitmatrix for fast child-parent-queries.
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

/// A directed edge representing a parent-child relationship in a graph.
#[derive(Hash, Eq, Debug, Clone, PartialEq, Ord, PartialOrd)]
pub struct Edge {
    parent: String,
    child: String,
}

impl Edge {
    pub fn new(parent: String, child: String) -> Self {
        Self { parent, child }
    }

    pub fn parent(&self) -> &str {
        &self.parent
    }

    pub fn child(&self) -> &str {
        &self.child
    }

    pub fn parent_child(self) -> (String, String) {
        (self.parent, self.child)
    }
}

impl From<(String, String)> for Edge {
    fn from(value: (String, String)) -> Self {
        Edge::new(value.0, value.1)
    }
}

impl From<&(String, String)> for Edge {
    fn from(value: &(String, String)) -> Self {
        Edge::new(value.0.clone(), value.1.clone())
    }
}

impl From<(&str, &str)> for Edge {
    fn from(value: (&str, &str)) -> Self {
        Edge::new(value.0.to_string(), value.1.to_string())
    }
}