public void Prims_AdjacencyListGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph <char, int>();
graph.AddVertex('S');
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('T');
graph.AddEdge('S', 'A', 8);
graph.AddEdge('S', 'C', 10);
graph.AddEdge('A', 'B', 10);
graph.AddEdge('A', 'C', 1);
graph.AddEdge('A', 'D', 8);
graph.AddEdge('B', 'T', 4);
graph.AddEdge('C', 'D', 1);
graph.AddEdge('D', 'B', 1);
graph.AddEdge('D', 'T', 10);
var algorithm = new Prims <char, int>();
var result = algorithm.FindMinimumSpanningTree(graph);
Assert.AreEqual(graph.VerticesCount - 1, result.Count);
}
public void FloydWarshall_AdjacencyListGraph_Smoke_Test()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph <char, int>();
graph.AddVertex('S');
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('T');
graph.AddEdge('S', 'A', 8);
graph.AddEdge('S', 'C', 10);
graph.AddEdge('A', 'B', 10);
graph.AddEdge('A', 'C', 1);
graph.AddEdge('A', 'D', 8);
graph.AddEdge('B', 'T', 4);
graph.AddEdge('C', 'D', 1);
graph.AddEdge('D', 'B', 1);
graph.AddEdge('D', 'T', 10);
var algorithm = new FloydWarshallShortestPath <char, int>(new FloydWarshallShortestPathOperators());
var result = algorithm.FindAllPairShortestPaths(graph);
var testCase = result.First(x => x.Source == 'S' && x.Destination == 'T');
Assert.AreEqual(15, testCase.Distance);
var expectedPath = new char[] { 'S', 'A', 'C', 'D', 'B', 'T' };
for (int i = 0; i < expectedPath.Length; i++)
{
Assert.AreEqual(expectedPath[i], testCase.Path[i]);
}
testCase = result.First(x => x.Source == 'T' && x.Destination == 'S');
Assert.AreEqual(15, testCase.Distance);
expectedPath = new char[] { 'T', 'B', 'D', 'C', 'A', 'S' };
for (int i = 0; i < expectedPath.Length; i++)
{
Assert.AreEqual(expectedPath[i], testCase.Path[i]);
}
}