undone Attribute Parameters

SpocWeb · SpocWeb · commit c5c5a9ddb120 · 2024-08-21T22:13:46.000+02:00
diff --git a/tests/QuikGraph.Tests/Algorithms/Condensation/EdgeMergeCondensationGraphAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Condensation/EdgeMergeCondensationGraphAlgorithmTests.cs
@@ -198,7 +198,7 @@ public void EdgeCondensationSomeVertices()
 
         [Test]
         [Category(TestCategories.LongRunning)]
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]
         public void EdgeCondensation(BidirectionalGraph<string, Edge<string>> graph)
         {
             var rand = new Random(123456);
diff --git a/tests/QuikGraph.Tests/Algorithms/ConnectedComponents/ConnectedComponentsAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/ConnectedComponents/ConnectedComponentsAlgorithmTests.cs
@@ -1,4 +1,4 @@
-using System;
+﻿using System;
 using System.Collections.Generic;
 using System.Linq;
 using JetBrains.Annotations;
@@ -211,7 +211,7 @@ public void MultipleComponents()
         }
 
         [Category(TestCategories.LongRunning)]
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), [10])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), new object[] { 10 })]
         public void ConnectedComponents(UndirectedGraph<string, Edge<string>> graph)
         {
             while (graph.EdgeCount > 0)
diff --git a/tests/QuikGraph.Tests/Algorithms/MaximumFlow/EdmondsKarpMaximumFlowAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/MaximumFlow/EdmondsKarpMaximumFlowAlgorithmTests.cs
@@ -370,7 +370,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.White, algorithm.GetVertexColor(3));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [100])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { 100 })]
         [Category(TestCategories.LongRunning)]
         public void EdmondsKarpMaxFlow(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/RandomWalks/CyclePoppingRandomTreeAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/RandomWalks/CyclePoppingRandomTreeAlgorithmTests.cs
@@ -350,7 +350,7 @@ public void GraphWithCycles()
             }
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [10])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { 10 })]
         [Category(TestCategories.LongRunning)]
         public void CyclePoppingRandomTree(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/RankedShortestPath/HoffmanPavleyRankedShortestPathAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/RankedShortestPath/HoffmanPavleyRankedShortestPathAlgorithmTests.cs
@@ -296,7 +296,7 @@ public void ComputeWithRootAndTarget_Throws()
 
         #endregion
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void HoffmanPavleyRankedShortestPath(BidirectionalGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/BestFirstFrontierSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/BestFirstFrontierSearchAlgorithmTests.cs
@@ -17,7 +17,7 @@ namespace QuikGraph.Tests.Algorithms.Search
     [TestFixture]
     internal sealed class BestFirstFrontierSearchAlgorithmTests : SearchAlgorithmTestsBase
     {
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public static void RunAndCheckSearch<TVertex, TEdge>(
             [NotNull] IBidirectionalGraph<TVertex, TEdge> graph)
@@ -280,7 +280,7 @@ public void SimpleGraph()
             RunAndCheckSearch(graph);
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void BestFirstFrontierComparedToDijkstraSearch(BidirectionalGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/BidirectionalDepthFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/BidirectionalDepthFirstSearchAlgorithmTests.cs
@@ -274,7 +274,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void DepthFirstSearch(BidirectionalGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/BreadthFirstSearchAlgirthmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/BreadthFirstSearchAlgirthmTests.cs
@@ -364,7 +364,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void BreadthFirstSearch(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/DepthFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/DepthFirstSearchAlgorithmTests.cs
@@ -1,4 +1,4 @@
-using System;
+﻿using System;
 using System.Collections.Generic;
 using System.Linq;
 using JetBrains.Annotations;
@@ -283,7 +283,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         public void DepthFirstSearch(AdjacencyGraph<string, Edge<string>> graph)
         {
             RunDFSAndCheck(graph);
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/EdgeDepthFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/EdgeDepthFirstSearchAlgorithmTests.cs
@@ -1,4 +1,4 @@
-using System;
+﻿using System;
 using System.Collections.Generic;
 using JetBrains.Annotations;
 using NUnit.Framework;
@@ -236,7 +236,7 @@ public void ComputeWithRoot_Throws()
 
         #endregion
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void EdgeDepthFirstSearch(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/ImplicitDepthFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/ImplicitDepthFirstSearchAlgorithmTests.cs
@@ -207,7 +207,7 @@ public void ComputeWithRoot_Throws()
 
         #endregion
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [10])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { 10 })]
         [Category(TestCategories.LongRunning)]
         public void ImplicitDepthFirstSearch(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/ImplicitEdgeDepthFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/ImplicitEdgeDepthFirstSearchAlgorithmTests.cs
@@ -204,7 +204,7 @@ public void ComputeWithRoot_Throws()
 
         #endregion
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void EdgeDepthFirstSearch(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/UndirectedBreathFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/UndirectedBreathFirstSearchAlgorithmTests.cs
@@ -340,7 +340,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), [10])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), new object[] { 10 })]
         public void UndirectedBreadthFirstSearch(UndirectedGraph<string, Edge<string>> graph)
         {
             foreach (string vertex in graph.Vertices)
diff --git a/tests/QuikGraph.Tests/Algorithms/Search/UndirectedDepthFirstSearchAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/Search/UndirectedDepthFirstSearchAlgorithmTests.cs
@@ -276,7 +276,7 @@ public void GetVertexColor()
         }
 
         [Category(TestCategories.LongRunning)]
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), new object[] { -1 })]
         public void UndirectedDepthFirstSearch(UndirectedGraph<string, Edge<string>> graph)
         {
             RunUndirectedDFSAndCheck(graph);
diff --git a/tests/QuikGraph.Tests/Algorithms/ShortestPath/AStarShortestPathAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/ShortestPath/AStarShortestPathAlgorithmTests.cs
@@ -287,7 +287,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void AStar(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/ShortestPath/BellmanFordShortestPathAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/ShortestPath/BellmanFordShortestPathAlgorithmTests.cs
@@ -238,7 +238,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void BellmanFord(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/ShortestPath/DagShortestPathAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/ShortestPath/DagShortestPathAlgorithmTests.cs
@@ -288,7 +288,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [50])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { 50 })]
         [Category(TestCategories.LongRunning)]
         public void DagShortestPath(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/ShortestPath/DijkstraShortestPathAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/ShortestPath/DijkstraShortestPathAlgorithmTests.cs
@@ -242,7 +242,7 @@ public void GetVertexColor()
             Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void Dijkstra(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/ShortestPath/FloydCompareTests.cs b/tests/QuikGraph.Tests/Algorithms/ShortestPath/FloydCompareTests.cs
@@ -83,7 +83,7 @@ private static void CompareAlgorithms<TVertex, TEdge, TGraph>(
 
         #endregion
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void FloydVsBellmannGraphML(AdjacencyGraph<string, Edge<string>> graph)
         {
@@ -100,7 +100,7 @@ public void FloydVsDijkstra()
                 => new DijkstraShortestPathAlgorithm<char, Edge<char>>(g, d));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         [Category(TestCategories.LongRunning)]
         public void FloydVsDijkstraGraphML(AdjacencyGraph<string, Edge<string>> graph)
         {
diff --git a/tests/QuikGraph.Tests/Algorithms/ShortestPath/UndirectedDijkstraShortestPathAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/ShortestPath/UndirectedDijkstraShortestPathAlgorithmTests.cs
@@ -237,7 +237,7 @@ public void GetVertexColor()
         }
 
         [Category(TestCategories.LongRunning)]
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), [20])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), new object[] { 20 })]
         public void UndirectedDijkstra(UndirectedGraph<string, Edge<string>> graph)
         {
             int cut = 0;
diff --git a/tests/QuikGraph.Tests/Algorithms/TarjanOfflineLeastCommonAncestorAlgorithmTests.cs b/tests/QuikGraph.Tests/Algorithms/TarjanOfflineLeastCommonAncestorAlgorithmTests.cs
@@ -1,4 +1,4 @@
-using System;
+﻿using System;
 using System.Collections.Generic;
 using System.Linq;
 using JetBrains.Annotations;
@@ -188,7 +188,7 @@ public void SetVertexPairs_Throws()
             Assert.Throws<ArgumentException>(() => algorithm.SetVertexPairs(new[] { new SEquatableEdge<int>(1, 2) }));
         }
 
-        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]
+        [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]
         public void TarjanOfflineLeastCommonAncestor(AdjacencyGraph<string, Edge<string>> graph)
         {
             if (graph.VertexCount == 0)

Original file line number	Diff line number	Diff line change
`@@ -198,7 +198,7 @@ public void EdgeCondensationSomeVertices()`
`198`	`198`
`199`	`199`	`[Test]`
`200`	`200`	`[Category(TestCategories.LongRunning)]`
`201`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]`
	`201`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]`
`202`	`202`	`public void EdgeCondensation(BidirectionalGraph<string, Edge<string>> graph)`
`203`	`203`	`{`
`204`	`204`	`var rand = new Random(123456);`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-using System;`
	`1`	`+using System;`
`2`	`2`	`using System.Collections.Generic;`
`3`	`3`	`using System.Linq;`
`4`	`4`	`using JetBrains.Annotations;`
`@@ -211,7 +211,7 @@ public void MultipleComponents()`
`211`	`211`	`}`
`212`	`212`
`213`	`213`	`[Category(TestCategories.LongRunning)]`
`214`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), [10])]`
	`214`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetUndirectedGraphs_SlowTests), new object[] { 10 })]`
`215`	`215`	`public void ConnectedComponents(UndirectedGraph<string, Edge<string>> graph)`
`216`	`216`	`{`
`217`	`217`	`while (graph.EdgeCount > 0)`
Original file line number	Diff line number	Diff line change
`@@ -370,7 +370,7 @@ public void GetVertexColor()`
`370`	`370`	`Assert.AreEqual(GraphColor.White, algorithm.GetVertexColor(3));`
`371`	`371`	`}`
`372`	`372`
`373`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [100])]`
	`373`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { 100 })]`
`374`	`374`	`[Category(TestCategories.LongRunning)]`
`375`	`375`	`public void EdmondsKarpMaxFlow(AdjacencyGraph<string, Edge<string>> graph)`
`376`	`376`	`{`
Original file line number	Diff line number	Diff line change
`@@ -350,7 +350,7 @@ public void GraphWithCycles()`
`350`	`350`	`}`
`351`	`351`	`}`
`352`	`352`
`353`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [10])]`
	`353`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { 10 })]`
`354`	`354`	`[Category(TestCategories.LongRunning)]`
`355`	`355`	`public void CyclePoppingRandomTree(AdjacencyGraph<string, Edge<string>> graph)`
`356`	`356`	`{`
Original file line number	Diff line number	Diff line change
`@@ -296,7 +296,7 @@ public void ComputeWithRootAndTarget_Throws()`
`296`	`296`
`297`	`297`	`#endregion`
`298`	`298`
`299`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]`
	`299`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]`
`300`	`300`	`[Category(TestCategories.LongRunning)]`
`301`	`301`	`public void HoffmanPavleyRankedShortestPath(BidirectionalGraph<string, Edge<string>> graph)`
`302`	`302`	`{`
Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ namespace QuikGraph.Tests.Algorithms.Search`
`17`	`17`	`[TestFixture]`
`18`	`18`	`internal sealed class BestFirstFrontierSearchAlgorithmTests : SearchAlgorithmTestsBase`
`19`	`19`	`{`
`20`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]`
	`20`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]`
`21`	`21`	`[Category(TestCategories.LongRunning)]`
`22`	`22`	`public static void RunAndCheckSearch<TVertex, TEdge>(`
`23`	`23`	`[NotNull] IBidirectionalGraph<TVertex, TEdge> graph)`
`@@ -280,7 +280,7 @@ public void SimpleGraph()`
`280`	`280`	`RunAndCheckSearch(graph);`
`281`	`281`	`}`
`282`	`282`
`283`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]`
	`283`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]`
`284`	`284`	`[Category(TestCategories.LongRunning)]`
`285`	`285`	`public void BestFirstFrontierComparedToDijkstraSearch(BidirectionalGraph<string, Edge<string>> graph)`
`286`	`286`	`{`
Original file line number	Diff line number	Diff line change
`@@ -274,7 +274,7 @@ public void GetVertexColor()`
`274`	`274`	`Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));`
`275`	`275`	`}`
`276`	`276`
`277`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), [-1])]`
	`277`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetBidirectionalGraphs_SlowTests), new object[] { -1 })]`
`278`	`278`	`[Category(TestCategories.LongRunning)]`
`279`	`279`	`public void DepthFirstSearch(BidirectionalGraph<string, Edge<string>> graph)`
`280`	`280`	`{`
Original file line number	Diff line number	Diff line change
`@@ -364,7 +364,7 @@ public void GetVertexColor()`
`364`	`364`	`Assert.AreEqual(GraphColor.Black, algorithm.GetVertexColor(2));`
`365`	`365`	`}`
`366`	`366`
`367`		`- [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), [-1])]`
	`367`	`+ [TestCaseSource(typeof(TestGraphFactory), nameof(TestGraphFactory.GetAdjacencyGraphs_SlowTests), new object[] { -1 })]`
`368`	`368`	`[Category(TestCategories.LongRunning)]`
`369`	`369`	`public void BreadthFirstSearch(AdjacencyGraph<string, Edge<string>> graph)`
`370`	`370`	`{`