private void CheckCycle()
{
var diGraph = DiGraph <string> .GetDiGraph(Model.NodesSource.Cast <NodeModel>(), Model.LinksSource.Cast <LinkModel>());
var algorithm = new CycleDetector <string>();
var HasCycle = algorithm.HasCycle(diGraph);
MessageBox.Show(HasCycle.ToString());
}
public void Graph_Cycle_Detection_Tests()
{
var graph = new DiGraph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddEdge('A', 'B');
graph.AddEdge('B', 'C');
graph.AddEdge('C', 'A');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'E');
graph.AddEdge('F', 'H');
var algo = new CycleDetector <char>();
Assert.IsTrue(algo.HasCycle(graph));
graph.RemoveEdge('C', 'A');
graph.RemoveEdge('G', 'E');
Assert.IsFalse(algo.HasCycle(graph));
}
public void Graph_Cycle_Detection_AdjancencyListGraph_Tests()
{
var graph = new Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraph <char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddEdge('A', 'B');
graph.AddEdge('B', 'C');
graph.AddEdge('C', 'A');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'E');
graph.AddEdge('F', 'H');
var algorithm = new CycleDetector <char>();
Assert.IsTrue(algorithm.HasCycle(graph));
graph.RemoveEdge('C', 'A');
graph.RemoveEdge('G', 'E');
Assert.IsFalse(algorithm.HasCycle(graph));
}
