-
Notifications
You must be signed in to change notification settings - Fork 2
/
simplegraph.go
226 lines (196 loc) · 4.26 KB
/
simplegraph.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
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
package propertygraph2go
type SimpleVertex struct {
key Key
incoming []*SimpleEdge
outgoing []*SimpleEdge
properties map[string]interface{}
}
func (v *SimpleVertex) Key() Key { return v.key }
func (v *SimpleVertex) Incoming() (es []Edge) {
for _, e := range v.incoming {
es = append(es, e)
}
return
}
func (v *SimpleVertex) Outgoing() (es []Edge) {
for _, e := range v.outgoing {
es = append(es, e)
}
return
}
func (v *SimpleVertex) GetProperty(key string) (property interface{}, err error) {
property, ok := v.properties[key]
if !ok {
err = ErrKeyNotFound
return
}
return
}
func (v *SimpleVertex) SetProperty(key string, property interface{}) (err error) {
v.properties[key] = property
return
}
func (v *SimpleVertex) Properties() (properties map[string]interface{}, err error) {
properties = v.properties
return
}
type SimpleEdge struct {
key Key
label string
head *SimpleVertex
tail *SimpleVertex
properties map[string]interface{}
}
func (e *SimpleEdge) Key() Key { return e.key }
func (e *SimpleEdge) Label() string { return e.label }
func (e *SimpleEdge) Head() Vertex { return e.head }
func (e *SimpleEdge) Tail() Vertex { return e.tail }
func (e *SimpleEdge) GetProperty(key string) (property interface{}, err error) {
property, ok := e.properties[key]
if !ok {
err = ErrKeyNotFound
return
}
return
}
func (e *SimpleEdge) SetProperty(key string, property interface{}) (err error) {
e.properties[key] = property
return
}
func (e *SimpleEdge) Properties() (properties map[string]interface{}, err error) {
properties = e.properties
return
}
type SimpleGraph struct {
vertices map[Key]*SimpleVertex
edges map[Key]*SimpleEdge
properties map[string]interface{}
}
func NewSimpleGraph() (g *SimpleGraph) {
g = &SimpleGraph{
vertices: map[Key]*SimpleVertex{},
edges: map[Key]*SimpleEdge{},
properties: map[string]interface{}{},
}
return
}
func (g *SimpleGraph) CreateVertex(key Key) (v Vertex, err error) {
v = &SimpleVertex{
key: key,
properties: map[string]interface{}{},
}
g.vertices[key] = v.(*SimpleVertex)
return
}
func (g *SimpleGraph) CreateEdge(key Key, label string, head, tail Key) (e Edge, err error) {
hv, ok := g.vertices[head]
if !ok {
err = ErrKeyNotFound
return
}
tv, ok := g.vertices[tail]
if !ok {
err = ErrKeyNotFound
return
}
se := &SimpleEdge{
key: key,
label: label,
head: hv,
tail: tv,
properties: map[string]interface{}{},
}
g.edges[key] = se
hv.incoming = append(hv.incoming, se)
tv.outgoing = append(tv.outgoing, se)
e = se
return
}
func (g *SimpleGraph) RemoveVertex(key Key) (err error) {
v, ok := g.vertices[key]
if !ok {
err = ErrKeyNotFound
return
}
for _, e := range v.incoming {
err = g.RemoveEdge(e.key)
if err != nil {
return
}
}
for _, e := range v.outgoing {
err = g.RemoveEdge(e.key)
if err != nil {
return
}
}
delete(g.vertices, key)
return
}
func (g *SimpleGraph) RemoveEdge(key Key) (err error) {
e, ok := g.edges[key]
if !ok {
err = ErrKeyNotFound
return
}
h := e.head
tmp := h.incoming
h.incoming = nil
for _, i := range tmp {
if i.key != key {
h.incoming = append(h.incoming, i)
}
}
t := e.tail
tmp = t.outgoing
t.outgoing = nil
for _, o := range tmp {
if o.key != key {
t.outgoing = append(t.outgoing, o)
}
}
delete(g.edges, key)
return
}
func (g *SimpleGraph) GetVertex(key Key) (v Vertex, err error) {
v, ok := g.vertices[key]
if !ok {
err = ErrKeyNotFound
}
return
}
func (g *SimpleGraph) GetEdge(key Key) (e Edge, err error) {
e, ok := g.edges[key]
if !ok {
err = ErrKeyNotFound
}
return
}
func (g *SimpleGraph) WalkVertices(w VertexWalker) (err error) {
for _, v := range g.vertices {
w(v)
}
return
}
func (g *SimpleGraph) WalkEdges(w EdgeWalker) (err error) {
for _, v := range g.edges {
w(v)
}
return
}
func (g *SimpleGraph) GetProperty(key string) (property interface{}, err error) {
property, ok := g.properties[key]
if !ok {
err = ErrKeyNotFound
return
}
return
}
func (g *SimpleGraph) SetProperty(key string, property interface{}) (err error) {
g.properties[key] = property
return
}
func (g *SimpleGraph) Properties() (properties map[string]interface{}, err error) {
properties = g.properties
return
}