public void UndirectedTopologicalSort()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
RunUndirectedTopologicalSortAndCheck(graph, true);
}
}
public void AdjacentDegreeSumEqualsTwiceEdgeCount()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
AssertAdjacentDegreeSumEqualsTwiceEdgeCount(graph);
}
}
public void KruskalMinimumSpanningTree()
{
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
Kruskal(graph);
}
}
public void ConversionToArrayGraph()
{
foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
{
AssertSameProperties(graph);
}
foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
{
AssertSameProperties(graph);
}
foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
{
AssertSameProperties(graph);
}
}
