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
#![doc = include_str!("../README.md")]
use std::collections::HashMap;
use uuid::Uuid;
#[derive(Debug)]
pub struct Graph<Node, EdgeData> {
pub nodes: HashMap<NodeIndex, Node>,
pub edges: HashMap<EdgeIndex, Edge<EdgeData>>,
}
#[derive(Debug, Clone)]
pub struct Edge<Data> {
pub nodes: (NodeIndex, NodeIndex),
pub data: Data,
}
impl<Data> Edge<Data> {
pub fn new(nodes: (NodeIndex, NodeIndex), data: Data) -> Edge<Data> {
Edge {
nodes,
data,
}
}
}
#[derive(Debug, Clone, Copy, Eq, Hash, Ord, PartialEq, PartialOrd)]
pub struct NodeIndex(Uuid);
#[derive(Debug, Clone, Copy, Eq, Hash, Ord, PartialEq, PartialOrd)]
pub struct EdgeIndex(Uuid);
impl NodeIndex {
pub fn new() -> NodeIndex {
NodeIndex(Uuid::new_v4())
}
}
impl EdgeIndex {
pub fn new() -> EdgeIndex {
EdgeIndex(Uuid::new_v4())
}
}
impl<Node, EdgeData> Graph<Node, EdgeData> {
pub fn new() -> Self {
Self {
nodes: HashMap::new(),
edges: HashMap::new()
}
}
pub fn nodes<'a>(&'a self) -> impl Iterator + 'a {
self.nodes.iter()
}
pub fn edges<'a>(&'a self) -> impl Iterator + 'a {
self.edges.iter()
}
pub fn edge(&mut self, edge: Edge<EdgeData>) -> EdgeIndex {
let idx = EdgeIndex::new();
self.edges.insert(idx, edge);
idx
}
pub fn r_edge(&mut self, idx: EdgeIndex) -> Option<Edge<EdgeData>> {
self.edges.remove(&idx)
}
pub fn node(&mut self, node: Node) -> NodeIndex {
let idx = NodeIndex::new();
self.nodes.insert(idx, node);
idx
}
pub fn r_node(&mut self, idx: NodeIndex) -> Option<Node> {
self.nodes.remove(&idx)
}
}
pub mod prelude {
pub use crate::{
Graph,
NodeIndex,
EdgeIndex,
Edge,
};
}