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
pub mod edges;
pub mod graph;
use crate::{
configs, defaults,
helpers::err,
network::{Graph, MetricIdx},
};
use log::info;
use progressing::{bernoulli::Bar as BernoulliBar, Baring};
use std::io::Write;
fn write_edges_to_file<W: Write>(
writer: &mut W,
graph: &Graph,
writing_cfg: &crate::configs::writing::network::edges::Config,
) -> err::Feedback {
let fwd_edges = graph.fwd_edges();
let bwd_edges = graph.bwd_edges();
let nodes = graph.nodes();
// write header
if writing_cfg.is_writing_header {
for (i, edge_info) in writing_cfg
.ids
.iter()
.map(|id| match id {
Some(id) => format!("{}", id.0),
None => format!("{}", defaults::writing::IGNORE_STR),
})
.enumerate()
{
write!(writer, "{}", edge_info)?;
// Sth has been written, so
// write space if needed
if i < writing_cfg.ids.len() - 1 {
write!(writer, " ")?;
}
}
// write end of line
writeln!(writer, "")?;
}
// write edges to file
let mut progress_bar = BernoulliBar::with_goal(fwd_edges.count()).timed();
info!("{}", progress_bar);
// for every edge
for edge_idx in fwd_edges.iter() {
// if shortcut, check if shortcuts are expected to be written
if !writing_cfg.is_writing_shortcuts && fwd_edges.is_shortcut(edge_idx) {
// print progress
progress_bar.add(true);
if progress_bar.has_progressed_significantly() {
progress_bar.remember_significant_progress();
info!("{}", progress_bar);
}
// print shortcuts only if expected to, which is not the case here
continue;
}
// loop over graphs config
// and print respective data
// if id fits
// for every writing-cfg-item
for (i, next_id) in writing_cfg.ids.iter().enumerate() {
if let Some(next_id) = next_id {
let mut has_been_written = false;
// Now: Ignore-case is already covered
// look for category of same id
// and write data to file
for category in graph.cfg().edges.categories.iter() {
match category {
configs::parsing::edges::Category::Meta { info, id } => {
if id != next_id {
continue;
}
match info {
configs::parsing::edges::MetaInfo::EdgeId => {
let edge_id = fwd_edges.id(edge_idx);
write!(writer, "{}", edge_id)?;
}
configs::parsing::edges::MetaInfo::SrcId => {
let src_idx = bwd_edges.dst_idx(edge_idx);
let src_id = nodes.id(src_idx);
write!(writer, "{}", src_id)?;
}
configs::parsing::edges::MetaInfo::SrcIdx => {
let src_idx = bwd_edges.dst_idx(edge_idx);
write!(writer, "{}", src_idx)?;
}
configs::parsing::edges::MetaInfo::SrcLat => {
let src_idx = bwd_edges.dst_idx(edge_idx);
let src_lat = nodes.coord(src_idx).lat;
write!(writer, "{}", src_lat)?;
}
configs::parsing::edges::MetaInfo::SrcLon => {
let src_idx = bwd_edges.dst_idx(edge_idx);
let src_lon = nodes.coord(src_idx).lon;
write!(writer, "{}", src_lon)?;
}
configs::parsing::edges::MetaInfo::DstId => {
let dst_idx = fwd_edges.dst_idx(edge_idx);
let dst_id = nodes.id(dst_idx);
write!(writer, "{}", dst_id)?;
}
configs::parsing::edges::MetaInfo::DstIdx => {
let dst_idx = fwd_edges.dst_idx(edge_idx);
write!(writer, "{}", dst_idx)?;
}
configs::parsing::edges::MetaInfo::DstLat => {
let dst_idx = bwd_edges.dst_idx(edge_idx);
let dst_lat = nodes.coord(dst_idx).lat;
write!(writer, "{}", dst_lat)?;
}
configs::parsing::edges::MetaInfo::DstLon => {
let dst_idx = bwd_edges.dst_idx(edge_idx);
let dst_lon = nodes.coord(dst_idx).lon;
write!(writer, "{}", dst_lon)?;
}
configs::parsing::edges::MetaInfo::ShortcutIdx0 => {
match fwd_edges.sc_edges(edge_idx) {
Some(sc_edges) => write!(writer, "{}", sc_edges[0])?,
None => write!(
writer,
"{}",
defaults::writing::NO_SHORTCUT_IDX
)?,
}
}
configs::parsing::edges::MetaInfo::ShortcutIdx1 => {
match fwd_edges.sc_edges(edge_idx) {
Some(sc_edges) => write!(writer, "{}", sc_edges[1])?,
None => write!(
writer,
"{}",
defaults::writing::NO_SHORTCUT_IDX
)?,
}
}
}
}
configs::parsing::edges::Category::Metric {
unit: _,
id: metric_id,
} => {
if metric_id != next_id {
continue;
}
// get metric-idx from graph's config
let metric_idx = MetricIdx(
graph
.cfg()
.edges
.metrics
.ids
.iter()
.position(|id| metric_id == id)
.expect(&format!(
"The metric-id {} doesn't exist in graph.",
metric_id
)),
);
// denormalize metric if wished
let mut metric_value = graph.metrics()[edge_idx][*metric_idx];
if writing_cfg.is_denormalizing {
// check if graph is normalized
if let Some(mean) = graph.metrics().mean(metric_idx) {
metric_value *= mean;
}
};
write!(writer, "{}", metric_value)?;
}
configs::parsing::edges::Category::Ignored => continue, // covered in else-case
}
// When here, no 'continue' has been called
// so sth has been written.
has_been_written = true;
break;
}
// if nothing has been written
// -> id is not in config
if !has_been_written {
return Err(format!(
"Writing-config has id {} which is not part of graph's edge-data.",
next_id
)
.into());
}
} else {
// if id is None
// -> ignore column
write!(writer, "{}", defaults::writing::IGNORE_STR)?;
}
// Sth has been written, so
// write space if needed
if i < writing_cfg.ids.len() - 1 {
write!(writer, " ")?;
}
}
// write end of line
writeln!(writer, "")?;
// print progress
progress_bar.add(true);
if progress_bar.has_progressed_significantly() {
progress_bar.remember_significant_progress();
info!("{}", progress_bar);
}
}
Ok(())
}