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
use petgraph::{
prelude::*,
visit::{GraphProp, IntoEdgeReferences, IntoNodeReferences, NodeIndexable, NodeRef},
};
use std::fmt::{self, Write};
static INDENT: &str = " ";
pub trait DotVisitor<NR, ER> {
fn visit_node(&self, node: NR, f: &mut DotWrite<'_, '_>) -> fmt::Result;
fn visit_edge(&self, edge: ER, f: &mut DotWrite<'_, '_>) -> fmt::Result;
}
#[derive(Copy, Clone, Debug)]
pub struct DisplayVisitor;
impl<NR, ER> DotVisitor<NR, ER> for DisplayVisitor
where
NR: NodeRef,
ER: EdgeRef,
NR::Weight: fmt::Display,
ER::Weight: fmt::Display,
{
fn visit_node(&self, node: NR, f: &mut DotWrite<'_, '_>) -> fmt::Result {
write!(f, "{}", node.weight())
}
fn visit_edge(&self, edge: ER, f: &mut DotWrite<'_, '_>) -> fmt::Result {
write!(f, "{}", edge.weight())
}
}
impl<'a, NR, ER, T> DotVisitor<NR, ER> for &'a T
where
T: DotVisitor<NR, ER>,
{
fn visit_node(&self, node: NR, f: &mut DotWrite<'_, '_>) -> fmt::Result {
(*self).visit_node(node, f)
}
fn visit_edge(&self, edge: ER, f: &mut DotWrite<'_, '_>) -> fmt::Result {
(*self).visit_edge(edge, f)
}
}
#[derive(Clone, Debug)]
pub struct DotFmt<G, V> {
graph: G,
visitor: V,
}
impl<G, V> DotFmt<G, V>
where
for<'a> &'a G: IntoEdgeReferences + IntoNodeReferences + GraphProp + NodeIndexable,
for<'a> V:
DotVisitor<<&'a G as IntoNodeReferences>::NodeRef, <&'a G as IntoEdgeReferences>::EdgeRef>,
{
#[allow(dead_code)]
pub fn new(graph: G, visitor: V) -> Self {
Self { graph, visitor }
}
pub fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
writeln!(f, "{} {{", graph_type(&self.graph))?;
for node in self.graph.node_references() {
write!(
f,
"{}{} [label=\"",
INDENT,
(&self.graph).to_index(node.id())
)?;
self.visitor.visit_node(node, &mut DotWrite::new(f))?;
writeln!(f, "\"]")?;
}
let edge_str = edge_str(&self.graph);
for edge in self.graph.edge_references() {
write!(
f,
"{}{} {} {} [label=\"",
INDENT,
(&self.graph).to_index(edge.source()),
edge_str,
(&self.graph).to_index(edge.target())
)?;
self.visitor.visit_edge(edge, &mut DotWrite::new(f))?;
writeln!(f, "\"]")?;
}
writeln!(f, "}}")
}
}
impl<G, V> fmt::Display for DotFmt<G, V>
where
for<'a> &'a G: IntoEdgeReferences + IntoNodeReferences + GraphProp + NodeIndexable,
for<'a> V:
DotVisitor<<&'a G as IntoNodeReferences>::NodeRef, <&'a G as IntoEdgeReferences>::EdgeRef>,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.fmt(f)
}
}
pub struct DotWrite<'a, 'b> {
f: &'a mut fmt::Formatter<'b>,
escape_backslashes: bool,
}
impl<'a, 'b> DotWrite<'a, 'b> {
fn new(f: &'a mut fmt::Formatter<'b>) -> Self {
Self {
f,
escape_backslashes: true,
}
}
#[allow(dead_code)]
pub fn set_escape_backslashes(&mut self, escape_backslashes: bool) {
self.escape_backslashes = escape_backslashes;
}
pub fn write_fmt(&mut self, args: fmt::Arguments<'_>) -> fmt::Result {
Write::write_fmt(self, args)
}
}
impl<'a, 'b> Write for DotWrite<'a, 'b> {
fn write_str(&mut self, s: &str) -> fmt::Result {
for c in s.chars() {
self.write_char(c)?;
}
Ok(())
}
fn write_char(&mut self, c: char) -> fmt::Result {
match c {
'"' => self.f.write_str(r#"\""#),
'\n' => self.f.write_str(r#"\l"#),
'\\' if self.escape_backslashes => self.f.write_str(r#"\\"#),
c => self.f.write_char(c),
}
}
}
fn graph_type<G: GraphProp>(graph: G) -> &'static str {
if graph.is_directed() {
"digraph"
} else {
"graph"
}
}
fn edge_str<G: GraphProp>(graph: G) -> &'static str {
if graph.is_directed() {
"->"
} else {
"--"
}
}