/
SatisfiabilityGraphTests.cs
297 lines (253 loc) · 12.5 KB
/
SatisfiabilityGraphTests.cs
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using TopDag.Graphs;
using TopDag.Graphs.Nodes;
namespace TopDag.Tests
{
public class SatisfiabilityGraphTests
{
public class DumbSatNode : SatisfiabilityNode
{
private int _val;
public DumbSatNode(int satWhen1) => _val = satWhen1;
public override bool IsSatisfied() => _val == 1;
}
/// <summary>
/// Base class tests. Ensures SatisfiabilityGraph still works as a basic Dag.
/// </summary>
[TestClass]
public class SatDagTests: DagTests
{
[TestInitialize]
public new void Initialize() => Graph = new SatisfiabilityGraph<int, object>();
}
public class SatGraphBase
{
public SatisfiabilityGraph<string, DumbSatNode> Graph;
[TestInitialize]
public void Initialize() => Graph = new SatisfiabilityGraph<string, DumbSatNode>();
public void CheckSatPath(string[] expected, List<string[]> satPaths)
{
var foundPath = satPaths.FirstOrDefault(path => path.SequenceEqual(expected));
Assert.IsNotNull(foundPath);
}
}
/// <summary>
/// Tests for a top-down graph that looks like this:<br />
/// <code>
/// A
/// / \
/// B C
/// \ /
/// D
/// </code>
/// </summary>
public class BasicGraphTests : SatGraphBase
{
[TestClass]
public class IsSatisfiedTests : BasicGraphTests
{
[TestMethod]
public void AllSatisfiedReturnsTrue()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var sat = Graph.IsSatisfied();
Assert.AreEqual(true, sat);
}
[TestMethod]
public void WhenCIsUnsatisfiedReturnsTrue()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(0), new[] { "D" }); // not satisfied!
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var sat = Graph.IsSatisfied();
Assert.AreEqual(true, sat);
}
[TestMethod]
public void WhenBIsUnsatisfiedReturnsTrue()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(0), new[] { "D" }); // not satisfied!
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var paths = Graph.FindSatisfiedPaths();
var sat = Graph.IsSatisfied();
Assert.AreEqual(true, sat);
}
[TestMethod]
public void WhenDIsUnsatisfiedReturnsFalse()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(0), new string[0]); // not satisfied!
var sat = Graph.IsSatisfied();
Assert.AreEqual(false, sat);
}
[TestMethod]
public void WhenAIsUnsatisfiedReturnsFalse()
{
Graph.AddNode("A", new DumbSatNode(0), new[] { "B", "C" }); // not satisfied!
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var sat = Graph.IsSatisfied();
Assert.AreEqual(false, sat);
}
}
[TestClass]
public class FindSatisfiedPathsTests : BasicGraphTests
{
[TestMethod]
public void AllSatisfiedReturnsTwoPaths()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var paths = Graph.FindSatisfiedPaths();
Assert.AreEqual(2, paths.Count);
CheckSatPath(new[] { "A", "B", "D" }, paths);
CheckSatPath(new[] { "A", "C", "D" }, paths);
}
[TestMethod]
public void WhenCIsUnsatisfiedReturnsOnePath()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(0), new[] { "D" }); // not satisfied!
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var paths = Graph.FindSatisfiedPaths();
Assert.AreEqual(1, paths.Count);
CheckSatPath(new[] { "A", "B", "D" }, paths);
}
[TestMethod]
public void WhenBIsUnsatisfiedReturnsOnePath()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(0), new[] { "D" }); // not satisfied!
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var paths = Graph.FindSatisfiedPaths();
Assert.AreEqual(1, paths.Count);
CheckSatPath(new[] { "A", "C", "D" }, paths);
}
[TestMethod]
public void WhenDIsUnsatisfiedReturnsNoPaths()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(0), new string[0]); // not satisfied!
var paths = Graph.FindSatisfiedPaths();
Assert.AreEqual(0, paths.Count);
}
[TestMethod]
public void WhenAIsUnsatisfiedReturnsNoPaths()
{
Graph.AddNode("A", new DumbSatNode(0), new[] { "B", "C" }); // not satisfied!
Graph.AddNode("B", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("D", new DumbSatNode(1), new string[0]);
var paths = Graph.FindSatisfiedPaths();
Assert.AreEqual(0, paths.Count);
}
}
}
/// <summary>
/// Attempting to put this class through the ringer... See individual test comments for their graph layout.
/// </summary>
public class ComplexGraphTests : SatGraphBase
{
/// <summary>
/// Tests for a top-down graph that looks like this:<br />
/// <code>
/// A
/// /|\
/// / | \
/// / | \
/// / | \ J
/// M N(->K) / | \ /
/// \ | B C D
/// \ | /| | |\
/// L / | | K | \
/// \ / | | / | \
/// E F G H I(->M)
///
/// Not pictured well: N has an outgoing edge to K, and I has an outgoing edge to M.
/// </code>
/// See individual tests for which nodes are satisfied/unsatisfied in the given test.
/// </summary>
[TestClass]
public class FindSatisfiedPathsTests : ComplexGraphTests
{
/// <summary>
/// All nodes are satisfied.
/// </summary>
[TestMethod]
public void ScenarioAReturnsExpectedPaths()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C", "D" });
Graph.AddNode("B", new DumbSatNode(1), new[] { "E", "F" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "G" });
Graph.AddNode("D", new DumbSatNode(1), new[] { "H", "I" });
Graph.AddNode("E", new DumbSatNode(1), new string[0]);
Graph.AddNode("F", new DumbSatNode(1), new string[0]);
Graph.AddNode("G", new DumbSatNode(1), new string[0]);
Graph.AddNode("H", new DumbSatNode(1), new string[0]);
Graph.AddNode("I", new DumbSatNode(1), new[] { "M" });
Graph.AddNode("J", new DumbSatNode(1), new[] { "D" });
Graph.AddNode("K", new DumbSatNode(1), new[] { "G" });
Graph.AddNode("L", new DumbSatNode(1), new[] { "E" });
Graph.AddNode("M", new DumbSatNode(1), new[] { "L" });
Graph.AddNode("N", new DumbSatNode(1), new[] { "L", "K" });
var satPaths = Graph.FindSatisfiedPaths();
Assert.AreEqual(9, satPaths.Count);
CheckSatPath(new[] { "A", "B", "E" }, satPaths);
CheckSatPath(new[] { "A", "B", "F" }, satPaths);
CheckSatPath(new[] { "A", "C", "G" }, satPaths);
CheckSatPath(new[] { "A", "D", "H" }, satPaths);
CheckSatPath(new[] { "A", "D", "I", "M", "L", "E" }, satPaths);
CheckSatPath(new[] { "J", "D", "H" }, satPaths);
CheckSatPath(new[] { "J", "D", "I", "M", "L", "E" }, satPaths);
CheckSatPath(new[] { "N", "L", "E" }, satPaths);
CheckSatPath(new[] { "N", "K", "G" }, satPaths);
}
/// <summary>
/// All nodes are satisfied EXCEPT B, I, and J.
/// </summary>
[TestMethod]
public void ScenarioBReturnsExpectedPaths()
{
Graph.AddNode("A", new DumbSatNode(1), new[] { "B", "C", "D" });
Graph.AddNode("B", new DumbSatNode(0), new[] { "E", "F" });
Graph.AddNode("C", new DumbSatNode(1), new[] { "G" });
Graph.AddNode("D", new DumbSatNode(1), new[] { "H", "I" });
Graph.AddNode("E", new DumbSatNode(1), new string[0]);
Graph.AddNode("F", new DumbSatNode(1), new string[0]);
Graph.AddNode("G", new DumbSatNode(1), new string[0]);
Graph.AddNode("H", new DumbSatNode(1), new string[0]);
Graph.AddNode("I", new DumbSatNode(0), new[] { "M" });
Graph.AddNode("J", new DumbSatNode(0), new[] { "D" });
Graph.AddNode("K", new DumbSatNode(1), new[] { "G" });
Graph.AddNode("L", new DumbSatNode(1), new[] { "E" });
Graph.AddNode("M", new DumbSatNode(1), new[] { "L" });
Graph.AddNode("N", new DumbSatNode(1), new[] { "L", "K" });
var satPaths = Graph.FindSatisfiedPaths();
Assert.AreEqual(4, satPaths.Count);
CheckSatPath(new[] { "A", "C", "G" }, satPaths);
CheckSatPath(new[] { "A", "D", "H" }, satPaths);
CheckSatPath(new[] { "N", "L", "E" }, satPaths);
CheckSatPath(new[] { "N", "K", "G" }, satPaths);
}
}
}
}
}