-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathCriticalPathTests.cs
More file actions
240 lines (216 loc) · 5.6 KB
/
CriticalPathTests.cs
File metadata and controls
240 lines (216 loc) · 5.6 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
using System.Collections.Generic;
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.LongestPath;
using Xunit;
namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph.LongestPath;
public class CriticalPathTests
{
[Fact]
public void Base()
{
var sut = new CriticalPath();
var vertex1 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 1,
Weight = 5
},
new()
{
To = 3,
Weight = 9
},
new()
{
To = 4,
Weight = 14
}
}
};
var vertex2 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 2,
Weight = 7
}
}
};
var vertex3 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 4,
Weight = 4
}
}
};
var vertex4 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 4,
Weight = 11
}
}
};
var vertex5 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>()
};
var graph = new[] { vertex1, vertex2, vertex3, vertex4, vertex5 };
Assert.Equal(20, sut.GetCriticalPath(graph));
}
[Fact]
public void BiggerGraph()
{
var sut = new CriticalPath();
var vertex1 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 1,
Weight = 17
}
}
};
var vertex2 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 2,
Weight = 13
}
}
};
var vertex3 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 3,
Weight = 9
}
}
};
var vertex4 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 4,
Weight = 11
},
new()
{
To = 8,
Weight = 10
}
}
};
var vertex5 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>()
};
var vertex6 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 6,
Weight = 11
},
new()
{
To = 9,
Weight = 15
}
}
};
var vertex7 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 7,
Weight = 18
}
}
};
var vertex8 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 3,
Weight = 16
},
new()
{
To = 8,
Weight = 13
},
new()
{
To = 11,
Weight = 19
}
}
};
var vertex9 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>()
};
var vertex10 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 10,
Weight = 14
}
}
};
var vertex11 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>
{
new()
{
To = 11,
Weight = 17
}
}
};
var vertex12 = new WeightedGraphVertex
{
Edges = new List<WeightedGraphNodeEdge>()
};
var graph = new[]
{
vertex1, vertex2, vertex3, vertex4, vertex5,
vertex6, vertex7, vertex8, vertex9,
vertex10, vertex11, vertex12
};
Assert.Equal(56, sut.GetCriticalPath(graph));
}
}