Update HopcroftKarp_Tests.cs

justcoding121 · justcoding121 · commit 268af5827043 · 2020-11-09T18:09:28.000-07:00
diff --git a/tests/Advanced.Algorithms.Tests/Graph/Matching/HopcroftKarp_Tests.cs b/tests/Advanced.Algorithms.Tests/Graph/Matching/HopcroftKarp_Tests.cs
@@ -46,7 +46,7 @@ public void HopcroftKarp_AdjacencyListGraph_Smoke_Test()
         public void HopcroftKarp_AdjacencyMatrixGraph_Smoke_Test()
         {
 
-            var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph<char>();
+            var graph = new Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph<char>();
 
             graph.AddVertex('A');
             graph.AddVertex('B');
@@ -76,5 +76,36 @@ public void HopcroftKarp_AdjacencyMatrixGraph_Smoke_Test()
             Assert.AreEqual(result.Count, 4);
 
         }
+
+        //[TestMethod]
+        public void HopcroftKarp_AdjacencyListGraph_Accurancy_Test_1()
+        {
+
+            var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyList.Graph<char>();
+
+            graph.AddVertex('A');
+            graph.AddVertex('B');
+            graph.AddVertex('C');
+            graph.AddVertex('D');
+            graph.AddVertex('E');
+            graph.AddVertex('F');
+   
+            graph.AddEdge('A', 'D');
+            graph.AddEdge('A', 'E');
+            graph.AddEdge('A', 'F');
+            graph.AddEdge('B', 'D');
+            graph.AddEdge('B', 'E');
+            graph.AddEdge('B', 'F');
+            graph.AddEdge('C', 'D');
+            graph.AddEdge('C', 'E');
+            graph.AddEdge('C', 'F');
+
+            var algorithm = new HopcroftKarpMatching<char>();
+
+            var result = algorithm.GetMaxBiPartiteMatching(graph);
+
+            Assert.AreEqual(result.Count, 4);
+
+        }
     }
 }
