private void CheckComponentCount <TVertex, TEdge>(IVertexAndEdgeListGraph <TVertex, TEdge> g,
CondensationGraphAlgorithm <TVertex, TEdge, AdjacencyGraph <TVertex, TEdge> > algo)
where TEdge : IEdge <TVertex>
{
// check number of vertices = number of storngly connected components
int components = g.WeaklyConnectedComponents <TVertex, TEdge>(new Dictionary <TVertex, int>());
Assert.AreEqual(components, algo.CondensedGraph.VertexCount, "ComponentCount does not match");
}
private static void CheckComponentCount <TVertex, TEdge>(
[NotNull] IVertexAndEdgeListGraph <TVertex, TEdge> graph,
[NotNull] CondensationGraphAlgorithm <TVertex, TEdge, AdjacencyGraph <TVertex, TEdge> > algorithm)
where TEdge : IEdge <TVertex>
{
// Check number of vertices = number of strongly connected components
int components = graph.WeaklyConnectedComponents(new Dictionary <TVertex, int>());
Assert.AreEqual(components, algorithm.CondensedGraph.VertexCount, "Component count does not match.");
}
