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
use std::fmt::{self, Display, Write};
use visit::{GraphRef};
pub struct Dot<'a, G> {
graph: G,
config: &'a [Config],
}
static TYPE: [&'static str; 2] = ["graph", "digraph"];
static EDGE: [&'static str; 2] = ["--", "->"];
static INDENT: &'static str = " ";
impl<'a, G> Dot<'a, G> where G: GraphRef {
pub fn new(graph: G) -> Self {
Self::with_config(graph, &[])
}
pub fn with_config(graph: G, config: &'a [Config]) -> Self {
Dot {
graph: graph,
config: config,
}
}
}
#[derive(Debug, PartialEq, Eq)]
pub enum Config {
NodeIndexLabel,
EdgeIndexLabel,
EdgeNoLabel,
#[doc(hidden)]
_Incomplete(()),
}
use visit::{ IntoNodeReferences, NodeIndexable, IntoEdgeReferences, EdgeRef};
use visit::{ Data, NodeRef, GraphProp, };
impl<'a, G> Dot<'a, G>
{
fn graph_fmt<NF, EF, NW, EW>(&self, g: G, f: &mut fmt::Formatter,
mut node_fmt: NF, mut edge_fmt: EF) -> fmt::Result
where G: NodeIndexable + IntoNodeReferences + IntoEdgeReferences,
G: GraphProp,
G: Data<NodeWeight=NW, EdgeWeight=EW>,
NF: FnMut(&NW, &mut FnMut(&Display) -> fmt::Result) -> fmt::Result,
EF: FnMut(&EW, &mut FnMut(&Display) -> fmt::Result) -> fmt::Result,
{
try!(writeln!(f, "{} {{", TYPE[g.is_directed() as usize]));
for node in g.node_references() {
try!(write!(f, "{}{}", INDENT, g.to_index(node.id())));
if self.config.contains(&Config::NodeIndexLabel) {
try!(writeln!(f, ""));
} else {
try!(write!(f, " [label=\""));
try!(node_fmt(node.weight(), &mut |d| Escaped(d).fmt(f)));
try!(writeln!(f, "\"]"));
}
}
for (i, edge) in g.edge_references().enumerate() {
try!(write!(f, "{}{} {} {}",
INDENT,
g.to_index(edge.source()),
EDGE[g.is_directed() as usize],
g.to_index(edge.target())));
if self.config.contains(&Config::EdgeNoLabel) {
try!(writeln!(f, ""));
} else if self.config.contains(&Config::EdgeIndexLabel) {
try!(writeln!(f, " [label=\"{}\"]", i));
} else {
try!(write!(f, " [label=\""));
try!(edge_fmt(edge.weight(), &mut |d| Escaped(d).fmt(f)));
try!(writeln!(f, "\"]"));
}
}
try!(writeln!(f, "}}"));
Ok(())
}
}
impl<'a, G> fmt::Display for Dot<'a, G>
where G: IntoEdgeReferences + IntoNodeReferences + NodeIndexable + GraphProp,
G::EdgeWeight: fmt::Display,
G::NodeWeight: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.graph_fmt(self.graph, f, |n, cb| cb(n), |e, cb| cb(e))
}
}
impl<'a, G> fmt::Debug for Dot<'a, G>
where G: IntoEdgeReferences + IntoNodeReferences + NodeIndexable + GraphProp,
G::EdgeWeight: fmt::Debug,
G::NodeWeight: fmt::Debug,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.graph_fmt(self.graph, f,
|n, cb| cb(&DebugFmt(n)),
|e, cb| cb(&DebugFmt(e)))
}
}
struct Escaper<W>(W);
impl<W> fmt::Write for Escaper<W>
where W: fmt::Write
{
fn write_str(&mut self, s: &str) -> fmt::Result {
for c in s.chars() {
try!(self.write_char(c));
}
Ok(())
}
fn write_char(&mut self, c: char) -> fmt::Result {
match c {
'"' => try!(self.0.write_char('\\')),
'\n' => return self.0.write_str(r#"\l"#),
_ => { }
}
self.0.write_char(c)
}
}
struct Escaped<T>(T);
impl<T> fmt::Display for Escaped<T>
where T: fmt::Display
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if f.alternate() {
write!(&mut Escaper(f), "{:#}\\l", &self.0)
} else {
write!(&mut Escaper(f), "{}", &self.0)
}
}
}
struct DebugFmt<T>(T);
impl<T> fmt::Display for DebugFmt<T>
where T: fmt::Debug
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.0.fmt(f)
}
}