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
|
//Copyright 2017 GoGraphviz Authors
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.
package gographviz
import (
"testing"
)
func TestIssue21Subgraph(t *testing.T) {
inputString := `
digraph G {
Ga->Gb;
sA->sB;
ssA->ssB;
subgraph clusterone {
fillcolor=red;
style=filled;
sA;
sB;
subgraph clustertwo {
fillcolor=blue;
style=filled;
ssA;
ssB;
}
}
Ga;
Gb;
}
`
parsedGraph, err := Read([]byte(inputString))
if err != nil {
t.Fatal(err)
}
t.Logf("parsedGraph: %s", parsedGraph.String())
_, c1ok := parsedGraph.Relations.ParentToChildren["G"]["clusterone"]
_, c2ok := parsedGraph.Relations.ParentToChildren["clusterone"]["clustertwo"]
if !c1ok || !c2ok {
t.Fatalf("parsed: expected parent to child relation G-(%v)>clusterone-(%v)>clustertwo", c1ok, c2ok)
}
_, c1ok = parsedGraph.Relations.ChildToParents["clusterone"]["G"]
_, c2ok = parsedGraph.Relations.ChildToParents["clustertwo"]["clusterone"]
if !c1ok || !c2ok {
t.Fatalf("parsed: expected child to parent relation G-(%v)>clusterone-(%v)>clustertwo", c1ok, c2ok)
}
g := NewGraph()
if err := g.SetName("G"); err != nil {
t.Fatal(err)
}
if err := g.SetDir(true); err != nil {
t.Fatal(err)
}
if err := g.AddNode("G", "Ga", nil); err != nil {
t.Fatal(err)
}
if err := g.AddNode("G", "Gb", nil); err != nil {
t.Fatal(err)
}
if err := g.AddEdge("Ga", "Gb", true, nil); err != nil {
t.Fatal(err)
}
if err := g.AddSubGraph("G", "clusterone", map[string]string{
"style": "filled",
"fillcolor": "red",
}); err != nil {
t.Fatal(err)
}
if err := g.AddNode("clusterone", "sA", nil); err != nil {
t.Fatal(err)
}
if err := g.AddNode("clusterone", "sB", nil); err != nil {
t.Fatal(err)
}
if err := g.AddEdge("sA", "sB", true, nil); err != nil {
t.Fatal(err)
}
if err := g.AddSubGraph("clusterone", "clustertwo", map[string]string{
"style": "filled",
"fillcolor": "blue",
}); err != nil {
t.Fatal(err)
}
if err := g.AddNode("clustertwo", "ssA", nil); err != nil {
t.Fatal(err)
}
if err := g.AddNode("clustertwo", "ssB", nil); err != nil {
t.Fatal(err)
}
if err := g.AddEdge("ssA", "ssB", true, nil); err != nil {
t.Fatal(err)
}
t.Logf("apiGraph: %s", g.String())
_, c1ok = g.Relations.ParentToChildren["G"]["clusterone"]
_, c2ok = g.Relations.ParentToChildren["clusterone"]["clustertwo"]
if !c1ok || !c2ok {
t.Fatalf("api: expected parent to child relation G-(%v)>clusterone-(%v)>clustertwo", c1ok, c2ok)
}
_, c1ok = g.Relations.ChildToParents["clusterone"]["G"]
_, c2ok = g.Relations.ChildToParents["clustertwo"]["clusterone"]
if !c1ok || !c2ok {
t.Fatalf("api: expected child to parent relation G-(%v)>clusterone-(%v)>clustertwo", c1ok, c2ok)
}
}
|
