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
|
package dot
// Node represents a dot Node.
type Node struct {
AttributesMap
graph *Graph
id string
seq int
}
// ID returns the assigned id to this node.
func (n Node) ID() string { return n.id }
// Attr sets label=value and return the Node
func (n Node) Attr(label string, value interface{}) Node {
n.AttributesMap.Attr(label, value)
return n
}
// Label sets the attribute "label" to the given label
func (n Node) Label(label string) Node {
return n.Attr("label", label)
}
// Box sets the attribute "shape" to "box"
func (n Node) Box() Node {
return n.Attr("shape", "box")
}
// Edge sets label=value and returns the Edge for chaining.
func (n Node) Edge(toNode Node, labels ...string) Edge {
return n.graph.Edge(n, toNode, labels...)
}
// EdgesTo returns all existing edges between this Node and the argument Node.
func (n Node) EdgesTo(toNode Node) []Edge {
return n.graph.FindEdges(n, toNode)
}
// GetAttr returns the value stored by a name. Returns nil if missing.
func (n Node) GetAttr(name string) interface{} {
return n.attributes[name]
}
// ReverseEdge sets label=value and returns the Edge for chaining.
func (n Node) ReverseEdge(fromNode Node, labels ...string) Edge {
return n.graph.Edge(fromNode, n, labels...)
}
// BidirectionalEdge adds two edges, marks the first as invisible and the second with direction "both". Returns both edges.
func (n Node) BidirectionalEdge(toAndFromNode Node) []Edge {
e1 := n.Edge(toAndFromNode).Attr("style", "invis")
e2 := toAndFromNode.Edge(n).Attr("dir", "both")
return []Edge{e1, e2}
}
// NewRecordBuilder returns a new recordBuilder for setting the attributes for a record-shaped node.
// Call Build() on the builder to set the label and shape.
func (n Node) NewRecordBuilder() *recordBuilder {
return newRecordBuilder(n)
}
|
