forked from RedisGraph/redisgraph-go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
path.go
78 lines (64 loc) · 1.4 KB
/
path.go
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
package redisgraph
import (
"fmt"
"strings"
)
type Path struct {
Nodes []*Node
Edges []*Edge
}
func PathNew(nodes []interface{}, edges []interface{}) Path {
Nodes := make([]*Node, len(nodes))
for i := 0; i < len(nodes); i++ {
Nodes[i] = nodes[i].(*Node)
}
Edges := make([]*Edge, len(edges))
for i := 0; i < len(edges); i++ {
Edges[i] = edges[i].(*Edge)
}
return Path{
Edges : Edges,
Nodes : Nodes,
}
}
func (p Path) GetNodes() []*Node {
return p.Nodes
}
func (p Path) GetEdges() []*Edge {
return p.Edges
}
func (p Path) GetNode(index int) *Node {
return p.Nodes[index]
}
func (p Path) GetEdge(index int) *Edge{
return p.Edges[index]
}
func (p Path) FirstNode() *Node {
return p.GetNode(0)
}
func (p Path) LastNode() *Node {
return p.GetNode(p.NodesCount() - 1)
}
func (p Path) NodesCount() int {
return len(p.Nodes)
}
func (p Path) EdgeCount() int {
return len(p.Edges)
}
func (p Path) String() string {
s := []string{"<"}
edgeCount := p.EdgeCount()
for i := 0; i < edgeCount; i++ {
var node = p.GetNode(i)
s = append(s, "(" , fmt.Sprintf("%v", node.ID) , ")")
var edge = p.GetEdge(i)
if node.ID == edge.srcNodeID {
s = append(s, "-[" , fmt.Sprintf("%v", edge.ID) , "]->")
} else {
s= append(s, "<-[" , fmt.Sprintf("%v", edge.ID) , "]-")
}
}
s = append(s, "(" , fmt.Sprintf("%v", p.GetNode(edgeCount).ID) , ")")
s = append(s, ">")
return strings.Join(s, "")
}