/// <summary>
/// Tests if the class to check can be inserted into the parent class without creating a cycle.
/// </summary>
/// <param name="parent">The class into which </param>
/// <param name="classToCheck">The class which should get inserted.</param>
/// <param name="classes">An enumeration of all available classes.</param>
/// <returns>True if a cycle is detected, false otherwise.</returns>
public static bool IsCyclicIfClassIsAccessibleFromParent(ClassNode parent, ClassNode classToCheck, IEnumerable <ClassNode> classes)
{
Contract.Requires(parent != null);
Contract.Requires(classToCheck != null);
Contract.Requires(classes != null);
Contract.Requires(Contract.ForAll(classes, c => c != null));
var graph = new DirectedGraph <ClassNode>();
graph.AddVertices(classes);
graph.AddEdge(parent, classToCheck);
foreach (var c in graph.Vertices)
{
foreach (var wrapperNode in c.Nodes.OfType <BaseWrapperNode>())
{
if (wrapperNode.ShouldPerformCycleCheckForInnerNode() && wrapperNode.ResolveMostInnerNode() is ClassNode classNode)
{
graph.AddEdge(c, classNode);
}
}
}
return(graph.ContainsCycle());
}
public void TestContainsCycle(int[] vertices, int[][] edges, bool containsCycle)
{
var sut = new DirectedGraph <int>();
sut.AddVertices(vertices);
foreach (var edge in edges)
{
sut.AddEdge(edge[0], edge[1]);
}
Check.That(sut.ContainsCycle()).IsEqualTo(containsCycle);
}
