We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 26818d3 commit 5255db7Copy full SHA for 5255db7
src/libgraphviz/lib.rs
@@ -839,8 +839,10 @@ r#"digraph single_cyclic_node {
839
let labels = AllNodesLabelled(vec!("{x,y}", "{x}", "{y}", "{}"));
840
let r = test_input(LabelledGraph::new("hasse_diagram",
841
labels,
842
- vec!(edge(0, 1, ""), edge(0, 2, ""),
843
- edge(1, 3, ""), edge(2, 3, ""))));
+ vec!(edge(0, 1, ""),
+ edge(0, 2, ""),
844
+ edge(1, 3, ""),
845
+ edge(2, 3, ""))));
846
assert_eq!(r.unwrap(),
847
r#"digraph hasse_diagram {
848
N0[label="{x,y}"];
@@ -873,8 +875,10 @@ r#"digraph hasse_diagram {
873
875
874
876
let g = LabelledGraphWithEscStrs::new("syntax_tree",
877
- vec!(edge(0, 1, "then"), edge(0, 2, "else"),
- edge(1, 3, ";"), edge(2, 3, ";" )));
878
+ vec!(edge(0, 1, "then"),
879
+ edge(0, 2, "else"),
880
+ edge(1, 3, ";"),
881
+ edge(2, 3, ";" )));
882
883
render(&g, &mut writer).unwrap();
884
let mut r = String::new();
0 commit comments