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
|
// Copyright 2020 CUE Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package flow
import (
"strconv"
"strings"
"testing"
)
// MermaidGraph exports mermaidGraph for external tests
var MermaidGraph = mermaidGraph
func TestIsCyclic(t *testing.T) {
testCases := []struct {
// semi-colon-separated list of nodes with comma-separated list
// of dependencies.
tasks string
cycle bool
}{{
tasks: "",
}, {
tasks: "0",
cycle: true,
}, {
tasks: "1; 0",
cycle: true,
}, {
tasks: "1; 2; 3; 4;",
}, {
tasks: "1; 2; ; 4; 5; ",
}, {
tasks: "1; 2; 3; 4; 0",
cycle: true,
}, {
tasks: "1,2,3,4; 2,3,4; 3,4; 4;",
}, {
tasks: ";0;0,1;0,1,2;0,1,2,3;",
}, {
tasks: "1,2,3,4; 2,3,4; 2; 4;",
cycle: true,
}}
for _, tc := range testCases {
t.Run(tc.tasks, func(t *testing.T) {
deps := strings.Split(tc.tasks, ";")
tasks := make([]*Task, len(deps))
for i := range tasks {
tasks[i] = &Task{index: i}
}
for i, d := range deps {
if d == "" {
continue
}
for _, num := range strings.Split(d, ",") {
num = strings.TrimSpace(num)
if num == "" {
continue
}
x, err := strconv.Atoi(num)
if err != nil {
t.Fatal(err)
}
t.Logf("%d -> %d", i, x)
tasks[i].depTasks = append(tasks[i].depTasks, tasks[x])
}
}
if got := checkCycle(tasks) != nil; got != tc.cycle {
t.Errorf("got %v; want %v", got, tc.cycle)
}
})
}
}
|
