@@ -52,11 +52,11 @@ public void SimpleEdgeGraphCost()
5252
5353 float [ , ] result = Dijkstra . Solve ( edges , 3 , 6 ) ;
5454
55- Assert . AreEqual ( result [ 3 , 2 ] , 0f ) ;
56- Assert . AreEqual ( result [ 2 , 2 ] , 3f ) ;
57- Assert . AreEqual ( result [ 1 , 2 ] , 4f ) ;
58- Assert . AreEqual ( result [ 0 , 2 ] , 6f ) ;
59- Assert . AreEqual ( result [ 4 , 2 ] , 7f ) ;
55+ Assert . AreEqual ( 0f , result [ 3 , 2 ] ) ;
56+ Assert . AreEqual ( 3f , result [ 2 , 2 ] ) ;
57+ Assert . AreEqual ( 4f , result [ 1 , 2 ] ) ;
58+ Assert . AreEqual ( 6f , result [ 0 , 2 ] ) ;
59+ Assert . AreEqual ( 7f , result [ 4 , 2 ] ) ;
6060 Assert . IsTrue ( float . IsPositiveInfinity ( result [ 5 , 2 ] ) ) ;
6161
6262 }
@@ -117,11 +117,11 @@ public void SimpleNetworkRouting()
117117
118118 float [ , ] result = Dijkstra . Solve ( edges , 9 ) ;
119119
120- Assert . AreEqual ( result [ 0 , 0 ] , 5f ) ; //Algorithm is choosing the next node that yields the shortest paths
121- Assert . AreEqual ( result [ 0 , 2 ] , 8f ) ;
120+ Assert . AreEqual ( 5f , result [ 0 , 0 ] ) ; //Algorithm is choosing the next node that yields the shortest paths
121+ Assert . AreEqual ( 8f , result [ 0 , 2 ] ) ;
122122
123- Assert . AreEqual ( result [ 1 , 0 ] , 7 ) ;
124- Assert . AreEqual ( result [ 1 , 2 ] , 5 ) ;
123+ Assert . AreEqual ( 7 , result [ 1 , 0 ] ) ;
124+ Assert . AreEqual ( 5 , result [ 1 , 2 ] ) ;
125125
126126 Assert . AreEqual ( 1 , result [ 2 , 0 ] ) ;
127127 Assert . AreEqual ( 6 , result [ 2 , 2 ] ) ;
@@ -241,10 +241,10 @@ public void MultipleDestSharedPath()
241241
242242 var result = Dijkstra . Solve ( edges , [ 0 , 3 ] , 4 ) ;
243243
244- Assert . AreEqual ( result [ 1 , 0 ] , 0 ) ;
245- Assert . AreEqual ( result [ 1 , 2 ] , 3 ) ;
246- Assert . AreEqual ( result [ 2 , 0 ] , 1 ) ;
247- Assert . AreEqual ( result [ 2 , 2 ] , 5 ) ;
244+ Assert . AreEqual ( 0 , result [ 1 , 0 ] ) ;
245+ Assert . AreEqual ( 3 , result [ 1 , 2 ] ) ;
246+ Assert . AreEqual ( 1 , result [ 2 , 0 ] ) ;
247+ Assert . AreEqual ( 5 , result [ 2 , 2 ] ) ;
248248 }
249249
250250 /// <summary>
@@ -262,10 +262,10 @@ public void DisconnectedComponent()
262262 new Edge ( 2 , 3 , 1 , 2 )
263263 } ;
264264 var result = Dijkstra . Solve ( edges , [ 0 , 3 ] , 4 ) ;
265- Assert . AreEqual ( result [ 1 , 0 ] , 0 ) ;
266- Assert . AreEqual ( result [ 1 , 2 ] , 3 ) ;
267- Assert . AreEqual ( result [ 2 , 0 ] , 3 ) ;
268- Assert . AreEqual ( result [ 2 , 2 ] , 1 ) ;
265+ Assert . AreEqual ( 0 , result [ 1 , 0 ] ) ;
266+ Assert . AreEqual ( 3 , result [ 1 , 2 ] ) ;
267+ Assert . AreEqual ( 3 , result [ 2 , 0 ] ) ;
268+ Assert . AreEqual ( 1 , result [ 2 , 2 ] ) ;
269269 }
270270
271271 /// <summary>
@@ -304,11 +304,11 @@ public void TrianglePath()
304304 } ;
305305
306306 var result = Dijkstra . Solve ( edges , [ 0 , 2 ] , 3 ) ;
307- Assert . AreEqual ( result [ 0 , 0 ] , 0 ) ;
308- Assert . AreEqual ( result [ 0 , 2 ] , 0 ) ;
309- Assert . AreEqual ( result [ 1 , 0 ] , 2 ) ;
310- Assert . AreEqual ( result [ 1 , 2 ] , 1 ) ;
311- Assert . AreEqual ( result [ 2 , 0 ] , 2 ) ;
307+ Assert . AreEqual ( 0 , result [ 0 , 0 ] ) ;
308+ Assert . AreEqual ( 0 , result [ 0 , 2 ] ) ;
309+ Assert . AreEqual ( 2 , result [ 1 , 0 ] ) ;
310+ Assert . AreEqual ( 1 , result [ 1 , 2 ] ) ;
311+ Assert . AreEqual ( 2 , result [ 2 , 0 ] ) ;
312312 }
313313 }
314314}
0 commit comments