algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/TarjansAlgorithmTests.cs at master · arst/algorithms-and-data-structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.Misc;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph;

public class TarjansAlgorithmTests
{
    [Fact]
    public void EmptyGraphHashNoArticulationPoints()
    {
        var sut = new TarjansAlgorithm();
        Assert.Empty(sut.GetArticulationPoints(new UndirectedGraph(0)));
    }

    [Fact]
    public void OneVerticeGraphHashNoArticulationPoints()
    {
        var sut = new TarjansAlgorithm();
        Assert.Empty(sut.GetArticulationPoints(new UndirectedGraph(1)));
    }

    [Fact]
    public void TwoVerticeGraphHashNoArticulationPoints()
    {
        var sut = new TarjansAlgorithm();
        var graph = new UndirectedGraph(2);
        graph.Connect(0, 1);
        Assert.Empty(sut.GetArticulationPoints(graph));
    }

    [Fact]
    public void ThreeVerticeGraphHashOneArticulationPoint()
    {
        var sut = new TarjansAlgorithm();
        var graph = new UndirectedGraph(3);
        graph.Connect(0, 1);
        graph.Connect(1, 2);
        Assert.Collection(sut.GetArticulationPoints(graph), arg => Assert.Equal(1, arg));
    }

    [Fact]
    public void NonDenseGraph()
    {
        var sut = new TarjansAlgorithm();
        var graph = new UndirectedGraph(5);
        graph.Connect(1, 0);
        graph.Connect(0, 2);
        graph.Connect(2, 1);
        graph.Connect(0, 3);
        graph.Connect(3, 4);
        Assert.Collection(sut.GetArticulationPoints(graph), arg => Assert.Equal(0, arg), arg => Assert.Equal(3, arg));
    }

    [Fact]
    public void DenseGraph()
    {
        var sut = new TarjansAlgorithm();
        var graph = new UndirectedGraph(7);
        graph.Connect(0, 1);
        graph.Connect(1, 2);
        graph.Connect(2, 0);
        graph.Connect(1, 3);
        graph.Connect(1, 4);
        graph.Connect(1, 6);
        graph.Connect(3, 5);
        graph.Connect(4, 5);
        Assert.Collection(sut.GetArticulationPoints(graph), arg => Assert.Equal(1, arg));
    }

    [Fact]
    public void LinedUpGraph()
    {
        var sut = new TarjansAlgorithm();
        var graph = new UndirectedGraph(4);
        graph.Connect(0, 1);
        graph.Connect(1, 2);
        graph.Connect(2, 3);
        Assert.Collection(sut.GetArticulationPoints(graph), arg => Assert.Equal(1, arg), arg => Assert.Equal(2, arg));
    }
}