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
|
package dot
import "sort"
func (g *Graph) sortedNodesKeys() (keys []string) {
for each := range g.nodes {
keys = append(keys, each)
}
sort.StringSlice(keys).Sort()
return
}
func (g *Graph) sortedEdgesFromKeys() (keys []string) {
for each := range g.edgesFrom {
keys = append(keys, each)
}
sort.StringSlice(keys).Sort()
return
}
func (g *Graph) sortedSubgraphsKeys() (keys []string) {
for each := range g.subgraphs {
keys = append(keys, each)
}
sort.StringSlice(keys).Sort()
return
}
|
