public void MinVertexCover_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <int>();
graph.AddVertex(0);
graph.AddVertex(1);
graph.AddVertex(2);
graph.AddVertex(3);
graph.AddVertex(4);
graph.AddEdge(0, 1);
graph.AddEdge(0, 2);
graph.AddEdge(0, 3);
graph.AddEdge(0, 4);
var algorithm = new MinVertexCover <int>();
var result = algorithm.GetMinVertexCover(graph);
Assert.IsTrue(result.Count() <= 2);
graph.RemoveEdge(0, 4);
graph.AddEdge(1, 4);
result = algorithm.GetMinVertexCover(graph);
Assert.IsTrue(result.Count() <= 4);
}
public void MaxBiPartiteMatch_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddVertex('I');
graph.AddEdge('A', 'F');
graph.AddEdge('B', 'F');
graph.AddEdge('B', 'G');
graph.AddEdge('C', 'H');
graph.AddEdge('C', 'I');
graph.AddEdge('D', 'G');
graph.AddEdge('D', 'H');
graph.AddEdge('E', 'F');
graph.AddEdge('E', 'I');
var algorithm = new BiPartiteMatching <char>(new BiPartiteMatchOperators());
var result = algorithm.GetMaxBiPartiteMatching(graph);
Assert.AreEqual(result.Count, 4);
}
public void DepthFirst_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddVertex('I');
graph.AddEdge('A', 'F');
graph.AddEdge('B', 'F');
graph.AddEdge('B', 'G');
graph.AddEdge('C', 'H');
graph.AddEdge('C', 'I');
graph.AddEdge('D', 'G');
graph.AddEdge('D', 'H');
graph.AddEdge('E', 'F');
graph.AddEdge('E', 'I');
var algorithm = new DepthFirst <char>();
Assert.IsTrue(algorithm.Find(graph, 'D'));
Assert.IsFalse(algorithm.Find(graph, 'M'));
}
public void TarjanBridge_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddEdge('A', 'B');
graph.AddEdge('A', 'C');
graph.AddEdge('B', 'C');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'E');
graph.AddEdge('F', 'H');
var algorithm = new TarjansBridgeFinder <char>();
var result = algorithm.FindBridges(graph);
Assert.AreEqual(3, result.Count);
var expected = new List <char[]>()
{
new char[] { 'C', 'D' },
new char[] { 'D', 'E' },
new char[] { 'F', 'H' }
};
foreach (var bridge in result)
{
Assert.IsTrue(expected.Any(x => bridge.vertexA == x[0] &&
bridge.vertexB == x[1]));
}
}
public void MaxBiPartiteMatch_AdjacencyMatrixGraph_Accuracy_Test_1()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <char>();
graph.AddVertex('0');
graph.AddVertex('1');
graph.AddVertex('2');
graph.AddVertex('3');
graph.AddEdge('0', '2');
graph.AddEdge('1', '3');
var algorithm = new BiPartiteMatching <char>(new BiPartiteMatchOperators());
var result = algorithm.GetMaxBiPartiteMatching(graph);
Assert.AreEqual(result.Count, 2);
}
public void MColoring_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <int>();
graph.AddVertex(0);
graph.AddVertex(1);
graph.AddVertex(2);
graph.AddVertex(3);
graph.AddEdge(0, 1);
graph.AddEdge(0, 2);
graph.AddEdge(0, 3);
graph.AddEdge(1, 2);
graph.AddEdge(2, 3);
var algorithm = new MColorer <int, string>();
var result = algorithm.Color(graph, new string[] { "red", "green", "blue" });
Assert.IsTrue(result.CanColor);
}
public void TarjanArticulation_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddEdge('A', 'B');
graph.AddEdge('A', 'C');
graph.AddEdge('B', 'C');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'E');
graph.AddEdge('F', 'H');
var algorithm = new TarjansArticulationFinder <char>();
var result = algorithm.FindArticulationPoints(graph);
Assert.AreEqual(4, result.Count);
var expectedResult = new char[] { 'C', 'D', 'E', 'F' };
foreach (var v in result)
{
Assert.IsTrue(expectedResult.Contains(v));
}
}
public void TarjanIsBiConnected_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddEdge('A', 'B');
graph.AddEdge('A', 'C');
graph.AddEdge('B', 'C');
var algorithm = new TarjansBiConnected <char>();
var result = algorithm.IsBiConnected(graph);
Assert.IsTrue(result);
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'E');
graph.AddEdge('F', 'H');
result = algorithm.IsBiConnected(graph);
Assert.IsFalse(result);
}
