algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/FleurysAlgorithmеtTests.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
83
84
85
86
87
88
89
90
91
92
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.Misc;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph;

public class FleurysAlgorithmеtTests
{
    [Fact]
    public void EmptyGraphHasEmptyEulerianTrail()
    {
        var sut = new FleurysAlgorithm();
        var graph = new UndirectedGraph(0);

        Assert.Empty(sut.GetEulerianTrail(graph));
    }

    [Fact]
    public void OneVerticeGraphHasEmptyEulerianTrail()
    {
        var sut = new FleurysAlgorithm();
        var graph = new UndirectedGraph(1);

        Assert.Empty(sut.GetEulerianTrail(graph));
    }

    [Fact]
    public void TwoVerticeGraphHasOneEdgeEulerianTrail()
    {
        var sut = new FleurysAlgorithm();
        var graph = new UndirectedGraph(2);
        graph.Connect(0, 1);

        Assert.Collection(sut.GetEulerianTrail(graph), arg =>
        {
            Assert.Equal(1, arg.Item1);
            Assert.Equal(0, arg.Item2);
        });
    }

    [Fact]
    public void ThreeVerticeGraphHasOneEdgeEulerianTrail()
    {
        var sut = new FleurysAlgorithm();
        var graph = new UndirectedGraph(3);
        graph.Connect(0, 1);
        graph.Connect(1, 2);

        Assert.Collection(sut.GetEulerianTrail(graph), arg =>
            {
                Assert.Equal(2, arg.Item1);
                Assert.Equal(1, arg.Item2);
            },
            arg =>
            {
                Assert.Equal(1, arg.Item1);
                Assert.Equal(0, arg.Item2);
            });
    }

    [Fact]
    public void BaseLine()
    {
        var sut = new FleurysAlgorithm();
        var graph = new UndirectedGraph(4);
        graph.Connect(0, 1);
        graph.Connect(0, 2);
        graph.Connect(1, 2);
        graph.Connect(2, 3);

        Assert.Collection(sut.GetEulerianTrail(graph), arg =>
            {
                Assert.Equal(3, arg.Item1);
                Assert.Equal(2, arg.Item2);
            },
            arg =>
            {
                Assert.Equal(2, arg.Item1);
                Assert.Equal(1, arg.Item2);
            },
            arg =>
            {
                Assert.Equal(1, arg.Item1);
                Assert.Equal(0, arg.Item2);
            },
            arg =>
            {
                Assert.Equal(0, arg.Item1);
                Assert.Equal(2, arg.Item2);
            });
    }
}