-
Notifications
You must be signed in to change notification settings - Fork 0
/
dag_test.go
91 lines (75 loc) · 1.4 KB
/
dag_test.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
package graph
import (
"fmt"
"testing"
)
func TestTopologicalSort(t *testing.T) {
graphAdj := NewGraphAdj[string, int]()
e3 := Edge[string, int]{
U: "shirt",
V: "tie",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e3)
e5 := Edge[string, int]{
U: "tie",
V: "jacket",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e5)
e4 := Edge[string, int]{
U: "shirt",
V: "belt",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e4)
e8 := Edge[string, int]{
U: "belt",
V: "jacket",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e8)
e1 := Edge[string, int]{
U: "panties",
V: "pants",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e1)
e9 := Edge[string, int]{
U: "panties",
V: "shoe",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e9)
e6 := Edge[string, int]{
U: "pants",
V: "belt",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e6)
e7 := Edge[string, int]{
U: "pants",
V: "shoe",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e7)
e2 := Edge[string, int]{
U: "socks",
V: "shoe",
W: 0,
NotDirect: false,
}
graphAdj.AddEdge(&e2)
graphAdj.AddVertex("watch")
fmt.Println(graphAdj)
ret := graphAdj.TopologicalSort()
fmt.Println(ret)
}