-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraph-theory-tests.factor
146 lines (135 loc) · 3.24 KB
/
graph-theory-tests.factor
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
USING: graph-theory graph-theory.directed tools.test locals kernel hash-sets ;
! -> syntax tests
{ { "src" "dst" 7 } } [ "src" -> "dst" 7 ] unit-test
{ { "x" "y" 3 }
{ "z" "w" 4 }
}
[ "x" -> "y" 3
"z" -> "w" 4
] unit-test
! empty constructor tests
{ { } } [ <directed-graph> get-vertices ] unit-test
{ { } } [ { } >directed-graph get-vertices ] unit-test
{ { } } [ DG{ } get-vertices ] unit-test
! empty constructor equivalence tests
{ t } [ <directed-graph> { } >directed-graph = ] unit-test
{ t } [ <directed-graph> DG{ } = ] unit-test
! no false equivalences
{ f } [ <directed-graph> { "x" -> "y" 1 } >directed-graph = ] unit-test
{ f } [ <directed-graph> DG{ "x" -> "y" 1 } = ] unit-test
{ f } [ { "x" -> "y" 2 } >directed-graph DG{ "x" -> "y" 1 } = ] unit-test
! constructor equivalences
{ t }
[ <directed-graph>
[ [ "x" "y" 1 ] dip add-edge ] keep
[ [ "y" "z" 2 ] dip add-edge ] keep
[ [ "y" "w" 3 ] dip add-edge ] keep
[ [ "z" "w" 4 ] dip add-edge ] keep
[ [ "a" ] dip add-vertex ] keep
DG{ "x" -> "y" 1
"y" -> "z" 2
"y" -> "w" 3
"z" -> "w" 4
"a"
}
=
] unit-test
{ t }
[ DG{ "x" -> "y" 1
"y" -> "z" 2
"y" -> "w" 3
"z" -> "w" 4
"a"
}
{ { "x" "y" 1 }
{ "y" "z" 2 }
{ "y" "w" 3 }
{ "z" "w" 4 }
"a"
} >directed-graph
=
] unit-test
! test order independence of constructors
{ t }
[ DG{ "x" -> "y" 1
"y" -> "z" 2
"a"
"y" -> "w" 3
"b"
"z" -> "w" 4
}
DG{ "b"
"y" -> "w" 3
"a"
"x" -> "y" 1
"z" -> "w" 4
"y" -> "z" 2
}
=
] unit-test
{ t }
[ <directed-graph>
[ [ "x" "y" 1 ] dip add-edge ] keep
[ [ "y" "z" 2 ] dip add-edge ] keep
[ [ "y" "w" 3 ] dip add-edge ] keep
[ [ "z" "w" 4 ] dip add-edge ] keep
[ [ "a" ] dip add-vertex ] keep
[ [ "b" ] dip add-vertex ] keep
<directed-graph>
[ [ "b" ] dip add-vertex ] keep
[ [ "y" "z" 2 ] dip add-edge ] keep
[ [ "a" ] dip add-vertex ] keep
[ [ "x" "y" 1 ] dip add-edge ] keep
[ [ "y" "w" 3 ] dip add-edge ] keep
[ [ "z" "w" 4 ] dip add-edge ] keep
=
] unit-test
! search tests
{ t t t t t t f f f f f f }
[ DG{ "x" -> "y" 1
"y" -> "z" 2
"y" -> "w" 3
"z" -> "w" 4
"b" -> "z" 5
"a"
}
! reachable
[ "x" "x" reachable-bfs? ] keep
[ "x" "y" reachable-bfs? ] keep
[ "x" "z" reachable-bfs? ] keep
[ "x" "w" reachable-bfs? ] keep
[ "a" "a" reachable-bfs? ] keep
[ "b" "w" reachable-bfs? ] keep
! unreachable
[ "x" "a" reachable-bfs? ] keep
[ "x" "b" reachable-bfs? ] keep
[ "y" "x" reachable-bfs? ] keep
[ "z" "x" reachable-bfs? ] keep
[ "z" "b" reachable-bfs? ] keep
[ "w" "x" reachable-bfs? ] keep
drop
] unit-test
{ t t t t t t f f f f f f }
[ DG{ "x" -> "y" 1
"y" -> "z" 2
"y" -> "w" 3
"z" -> "w" 4
"b" -> "z" 5
"a"
}
! reachable
[ "x" "x" reachable-dfs? ] keep
[ "x" "y" reachable-dfs? ] keep
[ "x" "z" reachable-dfs? ] keep
[ "x" "w" reachable-dfs? ] keep
[ "a" "a" reachable-dfs? ] keep
[ "b" "w" reachable-dfs? ] keep
! unreachable
[ "x" "a" reachable-dfs? ] keep
[ "x" "b" reachable-dfs? ] keep
[ "y" "x" reachable-dfs? ] keep
[ "z" "x" reachable-dfs? ] keep
[ "z" "b" reachable-dfs? ] keep
[ "w" "x" reachable-dfs? ] keep
drop
] unit-test