public void ComputeAll()
{
foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs())
{
Compute(graph);
}
}
public void PrimMinimumSpanningTreeAll()
{
foreach (var g in TestGraphFactory.GetUndirectedGraphs())
{
Prim(g);
}
}
public void FloydVsBellmannGraphML()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs())
{
Compare(graph, e => 1, (g, d) => new BellmanFordShortestPathAlgorithm <string, Edge <string> >(g, d));
}
}
public void AllAdjacencyGraphRoots()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs())
{
Roots(graph);
}
}
public void PrimKruskalMinimumSpanningTreeAll()
{
foreach (var g in TestGraphFactory.GetUndirectedGraphs())
{
this.CompareRoot(g);
}
}
public void StronglyConnectedCondensation()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
RunStronglyConnectedCondensationAndCheck(graph);
}
}
public void SameOutEdgesAll()
{
foreach (var g in TestGraphFactory.GetAdjacencyGraphs())
{
this.SameOutEdges(g);
}
}
public void SourceFirstTopologicalSort()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
RunSourceFirstTopologicalSortAndCheck(graph);
}
}
public void OutDegreeSumEqualsEdgeCountAll()
{
foreach (var g in TestGraphFactory.GetBidirectionalGraphs())
{
this.OutDegreeSumEqualsEdgeCount(g);
}
}
public void SortAll()
{
foreach (var g in TestGraphFactory.GetAdjacencyGraphs())
{
this.Sort(g);
}
}
public void AllVerticesAugmentor()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
RunAugmentationAndCheck(graph);
}
}
public void MultiSourceSinkGraphAugmentor()
{
foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
{
RunAugmentationAndCheck(graph);
}
}
public void ToDirectedGraphML_WithFormat()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
int formattedNodes = 0;
int formattedEdges = 0;
DirectedGraph directedGraph = graph.ToDirectedGraphML(
graph.GetVertexIdentity(),
graph.GetEdgeIdentity(),
(vertex, node) =>
{
Assert.IsNotNull(vertex);
Assert.IsNotNull(node);
++formattedNodes;
},
(edge, link) =>
{
Assert.IsNotNull(edge);
Assert.IsNotNull(link);
++formattedEdges;
});
Assert.IsNotNull(graph);
Assert.AreEqual(graph.VertexCount, formattedNodes);
Assert.AreEqual(graph.EdgeCount, formattedEdges);
AssertGraphContentEquivalent(graph, directedGraph);
}
}
public void UndirectedDepthFirstSearchAll()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs())
{
RunUndirectedDepthFirstSearchAndCheck(graph);
}
}
public void WeaklyConnectedComponents()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
RunWeaklyConnectedComponentsAndCheck(graph);
}
}
public void UndirectedDepthFirstSearchAll()
{
foreach (var g in TestGraphFactory.GetUndirectedGraphs())
{
this.UndirectedDepthFirstSearch(g);
}
}
public void StronglyConnectedComponentAll()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs())
{
Compute(graph);
}
}
public void TopologicalSortAll()
{
foreach (var g in TestGraphFactory.GetAdjacencyGraphs())
{
this.SortCyclic(g);
}
}
public void SameEdgeCountAll()
{
foreach (var g in TestGraphFactory.GetAdjacencyGraphs())
{
this.SameEdgeCount(g);
}
}
public void AdjacentDegreeSumEqualsTwiceEdgeCount()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
AssertAdjacentDegreeSumEqualsTwiceEdgeCount(graph);
}
}
public void UndirectedTopologicalSort()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
RunUndirectedTopologicalSortAndCheck(graph, true);
}
}
public void InDegreeSumEqualsEdgeCount()
{
foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
{
AssertInDegreeSumEqualsEdgeCount(graph);
}
}
public void ComputeAll()
{
foreach (var g in TestGraphFactory.GetBidirectionalGraphs())
{
this.Compute(g);
}
}
public void KruskalMinimumSpanningTree()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
Kruskal(graph);
}
}
public void KruskalMinimumSpanningTreeAll()
{
foreach (var g in TestGraphFactory.GetUndirectedGraphs())
{
Kruskal(g);
}
}
public void SourceFirstBidirectionalTopologicalSort_DCT8()
{
BidirectionalGraph <string, Edge <string> > graph = TestGraphFactory.LoadBidirectionalGraph(GetGraphFilePath("DCT8.graphml"));
RunSourceFirstTopologicalSortAndCheck(graph, TopologicalSortDirection.Forward);
RunSourceFirstTopologicalSortAndCheck(graph, TopologicalSortDirection.Backward);
}
public void BestFirstFrontierSearch()
{
foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_SlowTests())
{
RunAndCheckSearch(graph);
}
}
public void RandomWalk()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
RunRandomWalkAndCheck(graph);
}
}
public void AllAdjacencyGraphRoots()
{
foreach (var g in TestGraphFactory.GetAdjacencyGraphs())
{
Roots(g);
}
}
public void FloydVsDijkstraGraphML()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_SlowTests())
{
CompareAlgorithms(graph, _ => 1, (g, d) => new DijkstraShortestPathAlgorithm <string, Edge <string> >(g, d));
}
}
