algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/VertexCover/VertexCoverSimpleApproximationTests.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
82
using AlgorithmsAndDataStructures.Algorithms.Graph.VertexCover;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph.VertexCover;

public class VertexCoverSimpleApproximationTests
{
    [Fact]
    public void SingleVertexCover()
    {
        var sut = new VertexCoverSimpleApproximation();
        var graph = new int[4][];
        graph[0] = new[] { 0, 0, 0, 1 };
        graph[1] = new[] { 0, 0, 0, 1 };
        graph[2] = new[] { 0, 0, 0, 1 };
        graph[3] = new[] { 1, 1, 1, 0 };

        var vertexCover = sut.GetVertexCover(graph);

        Assert.Collection(vertexCover, arg => Assert.Equal(0, arg), arg => Assert.Equal(3, arg));
    }

    [Fact]
    public void SingleVertexCoverOptimized()
    {
        var sut = new VertexCoverSimpleApproximation();
        var graph = new int[4][];
        graph[0] = new[] { 0, 0, 0, 1 };
        graph[1] = new[] { 0, 0, 0, 1 };
        graph[2] = new[] { 0, 0, 0, 1 };
        graph[3] = new[] { 1, 1, 1, 0 };

        var vertexCover = sut.GetVertexCoverOptimized(graph);

        Assert.Collection(vertexCover, arg => Assert.Equal(3, arg));
    }

    [Fact]
    public void Baseline()
    {
        var sut = new VertexCoverSimpleApproximation();
        var graph = new int[7][];
        graph[0] = new[] { 0, 1, 1, 0, 0, 0, 0 };
        graph[1] = new[] { 1, 0, 0, 1, 0, 0, 0 };
        graph[2] = new[] { 1, 0, 0, 0, 0, 0, 0 };
        graph[3] = new[] { 0, 1, 0, 0, 1, 0, 0 };
        graph[4] = new[] { 0, 0, 0, 1, 0, 1, 0 };
        graph[5] = new[] { 0, 0, 0, 0, 1, 0, 1 };
        graph[6] = new[] { 0, 0, 0, 0, 0, 1, 0 };

        var vertexCover = sut.GetVertexCover(graph);

        Assert.Collection(vertexCover,
            arg => Assert.Equal(0, arg),
            arg => Assert.Equal(1, arg),
            arg => Assert.Equal(3, arg),
            arg => Assert.Equal(4, arg),
            arg => Assert.Equal(5, arg),
            arg => Assert.Equal(6, arg));
    }

    [Fact]
    public void BaselineOptimized()
    {
        var sut = new VertexCoverSimpleApproximation();
        var graph = new int[7][];
        graph[0] = new[] { 0, 1, 1, 0, 0, 0, 0 };
        graph[1] = new[] { 1, 0, 0, 1, 0, 0, 0 };
        graph[2] = new[] { 1, 0, 0, 0, 0, 0, 0 };
        graph[3] = new[] { 0, 1, 0, 0, 1, 0, 0 };
        graph[4] = new[] { 0, 0, 0, 1, 0, 1, 0 };
        graph[5] = new[] { 0, 0, 0, 0, 1, 0, 1 };
        graph[6] = new[] { 0, 0, 0, 0, 0, 1, 0 };

        var vertexCover = sut.GetVertexCoverOptimized(graph);

        Assert.Collection(vertexCover,
            arg => Assert.Equal(0, arg),
            arg => Assert.Equal(3, arg),
            arg => Assert.Equal(5, arg));
    }
}