graph/encoding/dot: allow unmarshalling of DOT IDs

This commit is contained in:
Dan Kortschak
2017-06-09 20:01:14 +09:30
committed by GitHub
parent 9e16ba4ad2
commit 2942f5c623
2 changed files with 26 additions and 6 deletions

View File

@@ -65,11 +65,11 @@ const directed = `digraph {
];
// Node definitions.
0 [label="foo 2"];
1 [label="bar 2"];
A [label="foo 2"];
B [label="bar 2"];
// Edge definitions.
0 -> 1 [label="baz 2"];
A -> B [label="baz 2"];
}`
const undirected = `graph {
@@ -86,11 +86,11 @@ const undirected = `graph {
];
// Node definitions.
0 [label="foo 2"];
1 [label="bar 2"];
A [label="foo 2"];
B [label="bar 2"];
// Edge definitions.
0 -- 1 [label="baz 2"];
A -- B [label="baz 2"];
}`
// Below follows a minimal implementation of a graph capable of validating the
@@ -187,10 +187,21 @@ func (g *dotUndirectedGraph) DOTUnmarshalerAttrs() (graph, node, edge Unmarshale
// and decoding of node DOT label attributes.
type dotNode struct {
simple.Node
dotID string
// Node label.
Label string
}
// DOTID returns the node's DOT ID.
func (n *dotNode) DOTID() string {
return n.dotID
}
// UnmarshalDOTID decodes a DOT ID.
func (n *dotNode) UnmarshalDOTID(id string) {
n.dotID = id
}
// UnmarshalDOTAttr decodes a single DOT attribute.
func (n *dotNode) UnmarshalDOTAttr(attr Attribute) error {
if attr.Key != "label" {