public void StronglyConnectedComponentsComplex()
{
var complexGraph = new DirectedGraph <int, EdgeData>();
complexGraph.AddNodes(1, 2, 3, 4, 5, 6, 7, 8);
complexGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 8, dummyEdgeData),
(3, 4, dummyEdgeData),
(3, 7, dummyEdgeData),
(4, 5, dummyEdgeData),
(5, 3, dummyEdgeData),
(5, 6, dummyEdgeData),
(7, 4, dummyEdgeData),
(7, 6, dummyEdgeData),
(8, 1, dummyEdgeData),
(8, 7, dummyEdgeData)
);
var result = complexGraph.StronglyConnectedComponents();
var sccA = new int[] { 3, 4, 5, 7 };
var sccB = new int[] { 1, 2, 8 };
var sccC = new int[] { 6 };
result.Should().ContainEquivalentOf(sccA);
result.Should().ContainEquivalentOf(sccB);
result.Should().ContainEquivalentOf(sccC);
Assert.That(result.Count, Is.EqualTo(3));
}
public void SimpleCyclesComplex()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(0, 1, 2, 3, 4, 5, 6, 7, 8, 9);
myGraph.AddEdges(
(0, 1, dummyEdgeData),
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(3, 0, dummyEdgeData),
(0, 3, dummyEdgeData),
(3, 4, dummyEdgeData),
(4, 5, dummyEdgeData),
(5, 0, dummyEdgeData),
(1, 6, dummyEdgeData),
(6, 7, dummyEdgeData),
(7, 8, dummyEdgeData),
(8, 0, dummyEdgeData),
(8, 9, dummyEdgeData)
);
var result = myGraph.SimpleCycles();
var cycleA = new int[] { 0, 3 };
var cycleB = new int[] { 0, 1, 2, 3, 4, 5 };
var cycleC = new int[] { 0, 1, 2, 3 };
var cycleD = new int[] { 0, 3, 4, 5 };
var cycleE = new int[] { 0, 1, 6, 7, 8 };
result.Should().ContainEquivalentOf(cycleA);
result.Should().ContainEquivalentOf(cycleB);
result.Should().ContainEquivalentOf(cycleC);
result.Should().ContainEquivalentOf(cycleD);
result.Should().ContainEquivalentOf(cycleE);
result.Should().HaveCount(5);
}
public void AddSelfEdge()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2);
myGraph.Invoking(x => x.AddEdge(1, 1, dummyEdgeData)).Should().Throw <ArgumentException>();
}
public void Order()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.Order.Should().Be(4);
}
public void EdgeExists()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2);
myGraph.AddEdge(1, 2, dummyEdgeData);
myGraph.Exists(1, 2).Should().BeTrue();
}
public void AddNodes()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(4, 20, 69);
Assert.IsTrue(myGraph.Exists(4));
Assert.IsTrue(myGraph.Exists(20));
Assert.IsTrue(myGraph.Exists(69));
}
public void EdgeData()
{
var myGraph = new DirectedGraph <int, NumEdgeData>();
myGraph.AddNodes(1, 2);
myGraph.AddEdge(1, 2, new NumEdgeData {
testNum = 4
});
myGraph.EdgeData(1, 2).testNum.Should().Be(4);
}
public void AddEdge()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(5, 6);
myGraph.AddEdge(5, 6, dummyEdgeData);
Assert.That(myGraph.Neighbors(5), Does.Contain(6));
myGraph.Invoking(x => x.AddEdge(5, 6, dummyEdgeData)).Should().Throw <ArgumentException>();
}
public void Acyclic()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(3, 4, dummyEdgeData)
);
Assert.That(myGraph.Cyclic(), Is.False);
}
public void TopologicalSortSimple()
{
var simpleGraph = new DirectedGraph <char, EdgeData>();
simpleGraph.AddNodes('a', 'b', 'c', 'd');
simpleGraph.AddEdges(
('a', 'b', dummyEdgeData),
('a', 'c', dummyEdgeData),
('b', 'a', dummyEdgeData),
('b', 'd', dummyEdgeData)
);
Assert.That(simpleGraph.TopologicalSort(), Is.EqualTo(new char[] { 'a', 'c', 'b', 'd' }));
}
public void Size()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 4, dummyEdgeData),
(3, 4, dummyEdgeData)
);
myGraph.Size.Should().Be(4);
}
public void Clear()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(3, 4, dummyEdgeData)
);
myGraph.Clear();
myGraph.Nodes.Should().BeEmpty();
}
public void Degree()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 4, dummyEdgeData),
(3, 4, dummyEdgeData)
);
myGraph.Degree(1).Should().Be(1);
myGraph.Degree(2).Should().Be(2);
myGraph.Degree(3).Should().Be(1);
}
public void RemoveEdge()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 4, dummyEdgeData),
(3, 4, dummyEdgeData)
);
myGraph.RemoveEdge(2, 3);
Assert.That(myGraph.Neighbors(2), Does.Not.Contain(3));
Assert.That(myGraph.Neighbors(2), Does.Contain(4));
}
public void LexicographicBFS()
{
var graph = new DirectedGraph <char, EdgeData>();
graph.AddNodes('a', 'b', 'c', 'd', 'e');
graph.AddEdges(
('a', 'b', dummyEdgeData),
('a', 'c', dummyEdgeData),
('b', 'c', dummyEdgeData),
('b', 'd', dummyEdgeData),
('b', 'e', dummyEdgeData),
('c', 'd', dummyEdgeData),
('d', 'e', dummyEdgeData)
);
graph.LexicographicBFS().Should().ContainInOrder(new char[] { 'a', 'b', 'c', 'd', 'e' });
}
public void RemoveNode()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 4, dummyEdgeData),
(3, 4, dummyEdgeData)
);
myGraph.RemoveNode(2);
myGraph.Nodes.Should().NotContain(2);
myGraph.Neighbors(1).Should().NotContain(2);
myGraph.Neighbors(3).Should().Contain(4);
}
public void StronglyConnectedComponentsSimple()
{
var simpleGraph = new DirectedGraph <int, EdgeData>();
simpleGraph.AddNodes(1, 2, 3);
simpleGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(3, 2, dummyEdgeData),
(2, 1, dummyEdgeData)
);
var result = simpleGraph.StronglyConnectedComponents();
var scc = new int[] { 1, 2, 3 };
result.Should().ContainEquivalentOf(scc);
Assert.That(result.Count, Is.EqualTo(1));
}
public void NodeBFS()
{
var myGraph = new DirectedGraph <char, EdgeData>();
myGraph.AddNodes('a', 'b', 'c', 'd', 'e');
myGraph.AddEdges(
('a', 'b', dummyEdgeData),
('a', 'c', dummyEdgeData),
('b', 'd', dummyEdgeData),
('c', 'e', dummyEdgeData)
);
var result = myGraph.NodeBFS().ToList();
result.IndexOf('a').Should().BeLessThan(result.IndexOf('b'));
result.IndexOf('a').Should().BeLessThan(result.IndexOf('c'));
result.IndexOf('b').Should().BeLessThan(result.IndexOf('d'));
result.IndexOf('c').Should().BeLessThan(result.IndexOf('e'));
}
public void SubGraph()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 1, dummyEdgeData),
(3, 4, dummyEdgeData)
);
var subGraph = myGraph.SubGraph(1, 2, 3);
subGraph.Nodes.Should().BeEquivalentTo(1, 2, 3);
subGraph.Neighbors(1).Should().BeEquivalentTo(2);
subGraph.Neighbors(2).Should().BeEquivalentTo(1, 3);
subGraph.Neighbors(3).Should().NotContain(4);
}
public void Clone()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(1, 2, 3, 4);
myGraph.AddEdges(
(1, 2, dummyEdgeData),
(2, 3, dummyEdgeData),
(2, 1, dummyEdgeData),
(3, 4, dummyEdgeData)
);
var clone = myGraph.Clone();
Assert.That(clone, Is.Not.EqualTo(myGraph));
clone.Nodes.Should().BeEquivalentTo(1, 2, 3, 4);
clone.Neighbors(1).Should().BeEquivalentTo(2);
clone.Neighbors(2).Should().BeEquivalentTo(3, 1);
clone.Neighbors(3).Should().BeEquivalentTo(4);
}
public void TopologicalSortComplex()
{
var complexGraph = new DirectedGraph <char, EdgeData>();
complexGraph.AddNodes('a', 'b', 'c', 'd', 'e', 'f', 'g', 't', 'm');
complexGraph.AddEdges(
('a', 'b', dummyEdgeData),
('a', 'c', dummyEdgeData),
('a', 'd', dummyEdgeData),
('b', 'f', dummyEdgeData),
('b', 'g', dummyEdgeData),
('c', 'g', dummyEdgeData),
('e', 't', dummyEdgeData),
('t', 'm', dummyEdgeData)
);
Assert.That(
complexGraph.TopologicalSort(),
Is.EqualTo(new char[] { 'e', 't', 'm', 'a', 'd', 'c', 'b', 'g', 'f' })
);
}
public void NodeDFS()
{
var myGraph = new DirectedGraph <char, EdgeData>();
myGraph.AddNodes('a', 'b', 'c', 'd');
myGraph.AddEdges(
('a', 'b', dummyEdgeData),
('a', 'c', dummyEdgeData),
('b', 'd', dummyEdgeData),
('c', 'd', dummyEdgeData)
);
var result = myGraph.PreorderNodeDFS().ToList();
var indexA = result.IndexOf('a');
var indexB = result.IndexOf('b');
var indexC = result.IndexOf('c');
var indexD = result.IndexOf('d');
Assert.That(indexA < indexB && indexA < indexC);
Assert.That(indexB < indexD || indexC < indexD);
}
public void StronglyConnectedComponentsMedium()
{
var mediumGraph = new DirectedGraph <int, EdgeData>();
mediumGraph.AddNodes(1, 2, 3, 4);
mediumGraph.AddEdges(
(1, 2, dummyEdgeData),
(1, 3, dummyEdgeData),
(1, 4, dummyEdgeData),
(4, 2, dummyEdgeData),
(3, 4, dummyEdgeData),
(2, 3, dummyEdgeData)
);
var result = mediumGraph.StronglyConnectedComponents();
var sccA = new int[] { 2, 3, 4 };
var sccB = new int[] { 1 };
result.Should().ContainEquivalentOf(sccA);
result.Should().ContainEquivalentOf(sccB);
Assert.That(result.Count, Is.EqualTo(2));
}
public void SimpleCyclesSimple()
{
var myGraph = new DirectedGraph <int, EdgeData>();
myGraph.AddNodes(0, 1, 2);
myGraph.AddEdges(
(0, 1, dummyEdgeData),
(0, 2, dummyEdgeData),
(1, 2, dummyEdgeData),
(2, 0, dummyEdgeData),
(2, 1, dummyEdgeData)
);
var result = myGraph.SimpleCycles();
var cycleA = new int[] { 0, 1, 2 };
var cycleB = new int[] { 0, 2 };
var cycleC = new int[] { 1, 2 };
result.Should().ContainEquivalentOf(cycleA);
result.Should().ContainEquivalentOf(cycleB);
result.Should().ContainEquivalentOf(cycleC);
result.Should().HaveCount(3);
}