wolf-graph 0.1.0

Data structures and algorithms for working with graphs with reference or value semantics.
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

use anyhow::Result;

use crate::{EdgeID, NodeID, VisitableGraph};

pub trait MutableGraph: VisitableGraph {
    fn add_node_with_data(&mut self, id: impl AsRef<NodeID>, data: Self::NData) -> Result<()>;

    fn adding_node_with_data(&self, id: impl AsRef<NodeID>, data: Self::NData) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.add_node_with_data(id, data)?;
        Ok(graph)
    }

    fn add_node(&mut self, id: impl AsRef<NodeID>) -> Result<()>
    where
        Self::NData: Default,
    {
        self.add_node_with_data(id, Self::NData::default())
    }

    fn adding_node(&self, id: impl AsRef<NodeID>) -> Result<Self>
    where
        Self: Clone + Sized,
        Self::NData: Default,
    {
        let mut graph = self.clone();
        graph.add_node(id)?;
        Ok(graph)
    }

    fn add_edge_with_data(&mut self, id: impl AsRef<EdgeID>, source: impl AsRef<NodeID>, target: impl AsRef<NodeID>, data: Self::EData) -> Result<()>;

    fn adding_edge_with_data(&self, id: impl AsRef<EdgeID>, source: impl AsRef<NodeID>, target: impl AsRef<NodeID>, data: Self::EData) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.add_edge_with_data(id, source, target, data)?;
        Ok(graph)
    }

    fn add_edge(&mut self, id: impl AsRef<EdgeID>, source: impl AsRef<NodeID>, target: impl AsRef<NodeID>) -> Result<()>
    where
        Self::EData: Default,
    {
        self.add_edge_with_data(id, source, target, Self::EData::default())
    }

    fn adding_edge(&self, id: impl AsRef<EdgeID>, source: impl AsRef<NodeID>, target: impl AsRef<NodeID>) -> Result<Self>
    where
        Self: Clone + Sized,
        Self::EData: Default,
    {
        let mut graph = self.clone();
        graph.add_edge(id, source, target)?;
        Ok(graph)
    }

    fn remove_edge(&mut self, id: impl AsRef<EdgeID>) -> Result<()>;

    fn removing_edge(&self, id: impl AsRef<EdgeID>) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.remove_edge(id)?;
        Ok(graph)
    }

    fn clear_edges(&mut self, id: impl AsRef<NodeID>) -> Result<()>;

    fn clearing_edges(&self, id: impl AsRef<NodeID>) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.clear_edges(id)?;
        Ok(graph)
    }

    fn remove_node(&mut self, id: impl AsRef<NodeID>) -> Result<()>;

    fn removing_node(&self, id: impl AsRef<NodeID>) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.remove_node(id)?;
        Ok(graph)
    }

    fn move_edge(&mut self, id: impl AsRef<EdgeID>, new_source: impl AsRef<NodeID>, new_target: impl AsRef<NodeID>) -> Result<()>;

    fn moving_edge(&self, id: impl AsRef<EdgeID>, new_source: impl AsRef<NodeID>, new_target: impl AsRef<NodeID>) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.move_edge(id, new_source, new_target)?;
        Ok(graph)
    }

    fn set_data(&mut self, data: Self::GData);

    fn setting_data(&self, data: Self::GData) -> Self
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.set_data(data);
        graph
    }

    fn set_node_data(&mut self, id: impl AsRef<NodeID>, data: Self::NData) -> Result<()>;

    fn setting_node_data(&self, id: impl AsRef<NodeID>, data: Self::NData) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.set_node_data(id, data)?;
        Ok(graph)
    }

    fn set_edge_data(&mut self, id: impl AsRef<EdgeID>, data: Self::EData) -> Result<()>;

    fn setting_edge_data(&self, id: impl AsRef<EdgeID>, data: Self::EData) -> Result<Self>
    where
        Self: Clone + Sized
    {
        let mut graph = self.clone();
        graph.set_edge_data(id, data)?;
        Ok(graph)
    }

    fn with_data(&mut self, transform: &dyn Fn(&mut Self::GData));

    fn with_node_data(&mut self, id: impl AsRef<NodeID>, transform: &dyn Fn(&mut Self::NData)) -> Result<()>;

    fn with_edge_data(&mut self, id: impl AsRef<EdgeID>, transform: &dyn Fn(&mut Self::EData)) -> Result<()>;
}