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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
use petgraph::graph::DiGraph;
use crate::data::edge::Edge;
use crate::data::vertex::Vertex;
use std::collections::HashMap;
use std::fs::File;
use std::io::BufRead;
use std::path::Path;
use std::sync::{Arc, OnceLock};
use std::{fmt, io};
use super::utils::{build_edge_vector, build_vertex_vector};
/// (Vetex Label, Vertex Type)
pub type VertexVectorKey = (usize, usize);
/// (From Vertex Label, From Vertex Type, Edge Label, To Vertex Label, To Vertex Type)
pub type EdgeVectorKey = (usize, usize, usize, usize, usize);
#[derive(Debug)]
pub struct GraphSetParseError {
message: String,
}
impl fmt::Display for GraphSetParseError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.message)
}
}
#[derive(Debug, Clone)]
pub struct Graph {
pub id: usize,
pub vertices: Vec<Vertex>,
vertex_vector: OnceLock<Arc<HashMap<VertexVectorKey, usize>>>,
edge_vector: OnceLock<Arc<HashMap<EdgeVectorKey, usize>>>,
digraph: OnceLock<Arc<DiGraph<(usize, usize), usize>>>,
}
impl Graph {
pub fn new(id: usize) -> Graph {
Graph {
id,
vertices: Vec::with_capacity(32),
vertex_vector: OnceLock::new(),
edge_vector: OnceLock::new(),
digraph: OnceLock::new(),
}
}
pub fn create_vertex(&mut self) -> &mut Vertex {
let vertex = Vertex::new(self.vertices.len(), None, None);
self.vertices.push(vertex);
self.get_last_vertex()
}
pub fn create_vertex_with_data(&mut self, label: usize, vertex_type: usize) -> &mut Vertex {
let vertex = self.create_vertex();
vertex.label = label;
vertex.vertex_type = vertex_type;
vertex
}
fn get_last_vertex(&mut self) -> &mut Vertex {
self.vertices.last_mut().unwrap()
}
pub fn has_vertex_with_id(&self, id: &usize) -> bool {
self.vertices.len() > *id
}
pub fn get_vertices_by_type(&self, vertex_type: usize) -> Vec<&Vertex> {
self.vertices
.iter()
.filter(|vertex| vertex.vertex_type == vertex_type)
.collect()
}
pub fn get_vertex_vector(&self) -> Arc<HashMap<(usize, usize), usize>> {
self.vertex_vector
.get_or_init(|| {
let map = build_vertex_vector(self);
Arc::new(map)
})
.clone()
}
pub fn get_edge_vector(&self) -> Arc<HashMap<EdgeVectorKey, usize>> {
self.edge_vector
.get_or_init(|| {
let map = build_edge_vector(self);
Arc::new(map)
})
.clone()
}
/// Returns an Arc-wrapped digraph, building it on first use.
pub fn get_digraph(&self) -> Arc<DiGraph<(usize, usize), usize>> {
self.digraph
.get_or_init(|| Arc::new(Self::build_digraph(self)))
.clone()
}
fn build_digraph(&self) -> DiGraph<(usize, usize), usize> {
let mut g = DiGraph::new();
let mut vertex_index_map = Vec::with_capacity(self.vertices.len());
// Add vertices
for v in &self.vertices {
let idx = g.add_node((v.label, v.vertex_type));
vertex_index_map.push(idx);
}
// Insert edges
for v in &self.vertices {
let from_idx = vertex_index_map[v.id];
for e in &v.edges {
let to_idx = vertex_index_map[e.to];
g.add_edge(from_idx, to_idx, e.e_label);
}
}
g
}
pub fn graphs_set_from_file<P>(path: P) -> Result<Vec<Graph>, GraphSetParseError>
where
P: AsRef<Path>,
{
let mut graph_list = Vec::new();
let mut graph_id = 0;
let mut current_graph: Graph = Graph::new(usize::MAX);
let line_reader = read_lines(path);
if line_reader.is_err() {
return Err(GraphSetParseError {
message: "Error reading file".to_string(),
});
}
let lines = line_reader.unwrap();
for data_line in lines.map_while(Result::ok) {
let mut data = data_line.split(" ");
if let Some(data_type) = data.next() {
match data_type {
"t" => {
let _ = data.next().ok_or(GraphSetParseError {
message: "Missing '#' in graph".to_string(),
})?;
let id = data.next().ok_or(GraphSetParseError {
message: "Id for graph is missing".to_string(),
})?;
if id == "-1" {
break;
}
if current_graph.id != usize::MAX {
graph_list.push(current_graph);
}
let id = id.parse::<usize>();
match id {
Ok(id) => {
current_graph = Graph::new(id);
if id != graph_id {
return Err(GraphSetParseError {
message: format!(
"Graph with graph id {}, it should have the id {}",
id, graph_id
),
});
}
graph_id += 1;
}
_ => {
return Err(GraphSetParseError {
message: "Id for graph invalid".to_string(),
});
}
}
}
"v" => {
let id = data.next().ok_or(GraphSetParseError {
message: format!(
"Graph {}, Missing id for a vertex in",
current_graph.id
)
.to_string(),
})?;
let id = id.parse::<usize>();
match id {
Ok(id) => {
let vertex = current_graph.create_vertex();
if vertex.id != id {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Vertex ID ({}) in input file does not fit the expected ID {}",
current_graph.id.clone(),
id,
current_graph.get_last_vertex().id
),
});
}
let label = data.next().ok_or(GraphSetParseError {
message: format!(
"Graph {}, Missing label for a vertex",
current_graph.id
)
.to_string(),
})?;
let label = label.parse::<usize>();
if label.is_err() {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Vertex {}, Label invalid",
current_graph.id, id
),
});
}
current_graph.get_last_vertex().label = label.unwrap();
let vertex_type = data.next().ok_or(GraphSetParseError {
message: format!(
"Graph {}, Missing vertex type for a vertex",
current_graph.id
)
.to_string(),
})?;
let vertex_type = vertex_type.parse::<usize>();
if vertex_type.is_err() {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Vertex {}, Vertex type is invalid",
current_graph.id, id
),
});
}
current_graph.get_last_vertex().vertex_type = vertex_type.unwrap();
}
_ => {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Vertex ID invalid",
current_graph.id
)
.to_string(),
});
}
}
}
"e" => {
let from_id = data.next().ok_or(GraphSetParseError {
message: format!(
"Graph {}, Missing from id for an edge",
current_graph.id
)
.to_string(),
})?;
let from_id: usize = match from_id.parse() {
Ok(value) => value,
_ => {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Invalid from id for an edge",
current_graph.id
)
.to_string(),
});
}
};
let to_id = data.next().ok_or(GraphSetParseError {
message: format!(
"Graph {}, Missing to id for a edge in",
current_graph.id
)
.to_string(),
})?;
let to_id: usize = match to_id.parse() {
Ok(value) => value,
_ => {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Invalid to id for a edge",
current_graph.id
)
.to_string(),
});
}
};
let e_label = data.next().ok_or(GraphSetParseError {
message: format!(
"Graph {}, Missing edge label for a edge",
current_graph.id
)
.to_string(),
})?;
let e_label: usize = match e_label.parse() {
Ok(value) => value,
_ => {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Invalid e_label for a edge",
current_graph.id
)
.to_string(),
});
}
};
if !current_graph.has_vertex_with_id(&from_id)
|| !current_graph.has_vertex_with_id(&to_id)
{
return Err(GraphSetParseError {
message: format!(
"Graph {}, Edge invalid, ids of vertices not found",
current_graph.id
)
.to_string(),
});
}
let from_vertex: Option<&mut Vertex> =
current_graph.vertices.get_mut(from_id);
match from_vertex {
Some(from_vertex) => {
from_vertex.push(to_id, e_label);
}
_ => {
return Err(GraphSetParseError {
message: format!(
"Graph {}, Edge invalid, ids of vertices not found",
current_graph.id
)
.to_string(),
});
}
}
}
_ => {}
}
}
}
if current_graph.id != usize::MAX {
graph_list.push(current_graph);
}
Ok(graph_list)
}
pub fn to_str_repr(
&self,
frequency_exact: Option<usize>,
frequency_relaxed: Option<usize>,
) -> String {
let mut lines: Vec<String> = Vec::new();
let mut g_rep = format!("t # {}", self.id);
if let Some(frequency_exact) = frequency_exact {
g_rep += &*format!(" * {}", frequency_exact);
}
if let Some(frequency_relaxed) = frequency_relaxed {
g_rep += &*format!(" / {}", frequency_relaxed);
}
lines.push(g_rep);
let mut edges: Vec<&Edge> = Vec::new();
for vertex in &self.vertices {
lines.push(vertex.to_str_repr());
edges.extend(vertex.edges.iter());
}
for edge in edges {
lines.push(edge.to_str_repr());
}
lines.join("\n")
}
}
fn read_lines<P>(filename: P) -> io::Result<io::Lines<io::BufReader<File>>>
where
P: AsRef<Path>,
{
let file = File::open(filename)?;
Ok(io::BufReader::new(file).lines())
}
#[cfg(test)]
mod tests {
use super::*;
use petgraph::visit::EdgeRef;
use std::time::Instant;
#[test]
fn test_simple_graph() {
let mut graph = Graph::new(1);
graph.create_vertex_with_data(1, 2);
graph.create_vertex_with_data(2, 2);
graph.create_vertex_with_data(3, 4);
graph.vertices.get_mut(0).unwrap().push(1, 0);
graph.vertices.get_mut(0).unwrap().push(2, 0);
graph.vertices.get_mut(1).unwrap().push(2, 0);
println!("{:?}", graph);
assert_eq!(graph.vertices.len(), 3);
assert_eq!(graph.vertices.first().unwrap().edges.len(), 2);
assert_eq!(graph.vertices.get(1).unwrap().edges.len(), 1);
assert_eq!(graph.vertices.get(2).unwrap().edges.len(), 0);
}
#[test]
fn test_load_graphs_from_file() {
let _now = Instant::now();
let graphs = Graph::graphs_set_from_file("test_data/graphs.txt");
match graphs {
Ok(ref graphs) => {
println!("All good parsing input file, found {} graphs", graphs.len());
}
Err(err) => panic!("{}", err.to_string()),
}
let _graphs = graphs.unwrap();
let delta = _now.elapsed().as_millis();
println!("Took {}ms", delta);
}
#[test]
fn test_build_digraph() {
let mut graph = Graph::new(1);
graph.create_vertex_with_data(1, 2);
graph.create_vertex_with_data(2, 2);
graph.create_vertex_with_data(3, 4);
graph.vertices.get_mut(0).unwrap().push(1, 0);
graph.vertices.get_mut(0).unwrap().push(2, 0);
graph.vertices.get_mut(1).unwrap().push(2, 0);
let di_graph = graph.get_digraph();
assert_eq!(di_graph.node_count(), 3);
// Check node weights
let nodes: Vec<_> = di_graph.node_weights().collect();
assert!(nodes.contains(&&(1, 2)));
assert!(nodes.contains(&&(2, 2)));
assert!(nodes.contains(&&(3, 4)));
// Check edges
let mut edges = di_graph
.edge_references()
.map(|e| (e.source().index(), e.target().index(), *e.weight()))
.collect::<Vec<_>>();
// Sort for consistent order
edges.sort();
// Expected edges (source_index, target_index, weight)
let expected_edges = vec![(0, 1, 0), (0, 2, 0), (1, 2, 0)];
assert_eq!(edges, expected_edges);
// Check lazy caching: multiple calls return same Arc
let di_graph2 = graph.get_digraph();
assert!(Arc::ptr_eq(&di_graph, &di_graph2));
}
}