-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph_test.go
More file actions
316 lines (249 loc) · 8.55 KB
/
graph_test.go
File metadata and controls
316 lines (249 loc) · 8.55 KB
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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
package gorkflow
import (
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
func TestNewExecutionGraph(t *testing.T) {
graph := NewExecutionGraph()
assert.NotNil(t, graph)
assert.NotNil(t, graph.Nodes)
assert.Empty(t, graph.Nodes)
assert.Empty(t, graph.EntryPoint)
}
func TestExecutionGraph_AddNode(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeParallel)
assert.Len(t, graph.Nodes, 2)
assert.NotNil(t, graph.Nodes["step1"])
assert.NotNil(t, graph.Nodes["step2"])
assert.Equal(t, NodeTypeSequential, graph.Nodes["step1"].Type)
assert.Equal(t, NodeTypeParallel, graph.Nodes["step2"].Type)
}
func TestExecutionGraph_AddEdge(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
err := graph.AddEdge("step1", "step2")
require.NoError(t, err)
assert.Contains(t, graph.Nodes["step1"].Next, "step2")
}
func TestExecutionGraph_AddEdge_NonExistentFrom(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step2", NodeTypeSequential)
err := graph.AddEdge("step1", "step2")
assert.Error(t, err)
assert.Contains(t, err.Error(), "step1 not found")
}
func TestExecutionGraph_AddEdge_NonExistentTo(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
err := graph.AddEdge("step1", "step2")
assert.Error(t, err)
assert.Contains(t, err.Error(), "step2 not found")
}
func TestExecutionGraph_SetEntryPoint(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
err := graph.SetEntryPoint("step1")
require.NoError(t, err)
assert.Equal(t, "step1", graph.EntryPoint)
}
func TestExecutionGraph_SetEntryPoint_NonExistent(t *testing.T) {
graph := NewExecutionGraph()
err := graph.SetEntryPoint("step1")
assert.Error(t, err)
assert.Contains(t, err.Error(), "not found")
}
func TestExecutionGraph_Validate_NoSteps(t *testing.T) {
graph := NewExecutionGraph()
err := graph.Validate()
assert.Error(t, err)
assert.Contains(t, err.Error(), "no entry point")
}
func TestExecutionGraph_Validate_NoEntryPoint(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.EntryPoint = "" // Manually clear entry point to test validation
err := graph.Validate()
assert.Error(t, err)
if err != nil {
assert.Contains(t, err.Error(), "no entry point")
}
}
func TestExecutionGraph_Validate_Cycle(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step2", "step3")
graph.AddEdge("step3", "step1") // Creates cycle
graph.SetEntryPoint("step1")
err := graph.Validate()
assert.Error(t, err)
assert.Contains(t, err.Error(), "cycle")
}
func TestExecutionGraph_Validate_UnreachableNodes(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential) // Unreachable
graph.AddEdge("step1", "step2")
graph.SetEntryPoint("step1")
err := graph.Validate()
assert.Error(t, err)
assert.Contains(t, err.Error(), "not all nodes are reachable")
}
func TestExecutionGraph_Validate_ValidSequential(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step2", "step3")
graph.SetEntryPoint("step1")
err := graph.Validate()
assert.NoError(t, err)
}
func TestExecutionGraph_Validate_ValidDiamond(t *testing.T) {
// Diamond pattern: step1 -> (step2, step3) -> step4
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddNode("step4", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step1", "step3")
graph.AddEdge("step2", "step4")
graph.AddEdge("step3", "step4")
graph.SetEntryPoint("step1")
err := graph.Validate()
assert.NoError(t, err)
}
func TestExecutionGraph_TopologicalSort_Linear(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step2", "step3")
graph.SetEntryPoint("step1")
order, err := graph.TopologicalSort()
require.NoError(t, err)
assert.Equal(t, []string{"step1", "step2", "step3"}, order)
}
func TestExecutionGraph_TopologicalSort_Diamond(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddNode("step4", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step1", "step3")
graph.AddEdge("step2", "step4")
graph.AddEdge("step3", "step4")
graph.SetEntryPoint("step1")
order, err := graph.TopologicalSort()
require.NoError(t, err)
assert.Len(t, order, 4)
assert.Equal(t, "step1", order[0]) // step1 must be first
assert.Equal(t, "step4", order[3]) // step4 must be last
// step2 and step3 can be in any order in the middle
assert.Contains(t, order[1:3], "step2")
assert.Contains(t, order[1:3], "step3")
}
func TestExecutionGraph_TopologicalSort_WithCycle(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step2", "step1")
graph.SetEntryPoint("step1")
_, err := graph.TopologicalSort()
assert.Error(t, err)
}
func TestExecutionGraph_GetTopologicalOrder(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.SetEntryPoint("step1")
order, err := graph.TopologicalSort()
require.NoError(t, err)
assert.Equal(t, []string{"step1", "step2"}, order)
}
func TestExecutionGraph_GetNextSteps(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step1", "step3")
nextSteps, err := graph.GetNextSteps("step1")
require.NoError(t, err)
assert.Len(t, nextSteps, 2)
assert.Contains(t, nextSteps, "step2")
assert.Contains(t, nextSteps, "step3")
}
func TestExecutionGraph_GetNextSteps_Terminal(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
nextSteps, err := graph.GetNextSteps("step1")
require.NoError(t, err)
assert.Empty(t, nextSteps)
}
func TestExecutionGraph_IsTerminal(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddEdge("step1", "step2")
assert.False(t, graph.IsTerminal("step1"))
assert.True(t, graph.IsTerminal("step2"))
}
func TestExecutionGraph_Clone(t *testing.T) {
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.SetEntryPoint("step1")
cloned := graph.Clone()
assert.Equal(t, graph.EntryPoint, cloned.EntryPoint)
assert.Len(t, cloned.Nodes, len(graph.Nodes))
// Verify deep copy
cloned.AddNode("step3", NodeTypeSequential)
assert.Len(t, graph.Nodes, 2)
assert.Len(t, cloned.Nodes, 3)
}
func TestExecutionGraph_ComplexTopologicalSort(t *testing.T) {
// More complex graph:
// step1
// / | \
// step2 step3 step4
// \ | /
// step5
graph := NewExecutionGraph()
graph.AddNode("step1", NodeTypeSequential)
graph.AddNode("step2", NodeTypeSequential)
graph.AddNode("step3", NodeTypeSequential)
graph.AddNode("step4", NodeTypeSequential)
graph.AddNode("step5", NodeTypeSequential)
graph.AddEdge("step1", "step2")
graph.AddEdge("step1", "step3")
graph.AddEdge("step1", "step4")
graph.AddEdge("step2", "step5")
graph.AddEdge("step3", "step5")
graph.AddEdge("step4", "step5")
graph.SetEntryPoint("step1")
order, err := graph.TopologicalSort()
require.NoError(t, err)
assert.Len(t, order, 5)
assert.Equal(t, "step1", order[0])
assert.Equal(t, "step5", order[4])
}
func TestNodeType_String(t *testing.T) {
assert.Equal(t, "SEQUENTIAL", NodeTypeSequential.String())
assert.Equal(t, "PARALLEL", NodeTypeParallel.String())
assert.Equal(t, "CONDITIONAL", NodeTypeConditional.String())
}