rsdiff-graphs 0.0.2

Computational graphs for Rust
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

/*
    Appellation: graph <module>
    Contrib: FL03 <jo3mccain@icloud.com>
*/

use crate::{DefaultIx, EdgeIndex, NodeIndex};
use core::marker::PhantomData;

pub trait GraphEntry {
    type Idx;
    type Weight;
}

pub trait ComputeGraph {
    type Edge: GraphEntry;
    type Node: GraphEntry;

    fn add_node(
        &mut self,
        node: <Self::Node as GraphEntry>::Weight,
    ) -> <Self::Node as GraphEntry>::Idx;

    fn add_edge(
        &mut self,
        src: <Self::Node as GraphEntry>::Idx,
        target: <Self::Node as GraphEntry>::Idx,
        weight: <Self::Edge as GraphEntry>::Weight,
    ) -> <Self::Edge as GraphEntry>::Idx;

    fn clear(&mut self);
}

pub struct Edge<Idx = DefaultIx, W = ()> {
    pub link: Link<Idx>,
    pub weight: Option<W>,
    _idx: PhantomData<EdgeIndex<Idx>>,
}

impl<Idx, W> Edge<Idx, W> {
    pub fn new(src: NodeIndex<Idx>, target: NodeIndex<Idx>, weight: Option<W>) -> Self {
        Self {
            link: Link::new(src, target),
            weight,
            _idx: PhantomData,
        }
    }

    pub fn from_link(link: Link<Idx>) -> Self {
        Self {
            link,
            weight: None,
            _idx: PhantomData,
        }
    }

    pub fn unweighted(src: NodeIndex<Idx>, target: NodeIndex<Idx>) -> Self {
        Self::new(src, target, None)
    }

    pub fn weighted(src: NodeIndex<Idx>, target: NodeIndex<Idx>, weight: W) -> Self {
        Self::new(src, target, Some(weight))
    }

    pub fn with_weight(self, weight: W) -> Self {
        Self {
            weight: Some(weight),
            ..self
        }
    }

    pub fn is_unweighted(&self) -> bool {
        self.weight.is_none()
    }

    pub fn is_weighted(&self) -> bool {
        self.weight.is_some()
    }

    pub fn weight(&self) -> Option<&W> {
        self.weight.as_ref()
    }

    pub fn weight_mut(&mut self) -> Option<&mut W> {
        self.weight.as_mut()
    }
}

impl<Idx, W> GraphEntry for Edge<Idx, W> {
    type Idx = EdgeIndex<Idx>;
    type Weight = W;
}

pub struct Link<Idx = DefaultIx> {
    pub src: NodeIndex<Idx>,
    pub target: NodeIndex<Idx>,
}

impl<Idx> Link<Idx> {
    pub fn new(src: NodeIndex<Idx>, target: NodeIndex<Idx>) -> Self {
        Self { src, target }
    }
}

pub trait GraphEdge {
    type Idx;

    fn src(&self) -> NodeIndex<Self::Idx>;

    fn target(&self) -> NodeIndex<Self::Idx>;
}

impl<Idx> GraphEdge for Link<Idx>
where
    Idx: Copy,
{
    type Idx = Idx;

    fn src(&self) -> NodeIndex<Idx> {
        self.src
    }

    fn target(&self) -> NodeIndex<Idx> {
        self.target
    }
}

impl<Idx, W> GraphEdge for Edge<Idx, W>
where
    Idx: Copy,
{
    type Idx = Idx;

    fn src(&self) -> NodeIndex<Idx> {
        self.link.src
    }

    fn target(&self) -> NodeIndex<Idx> {
        self.link.target
    }
}