algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/EulerianPathTests.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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.Misc;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph;

public class EulerianPathTests
{
    [Fact]
    public void EmptyGraphIsEulerian()
    {
        var sut = new EulerianPath();
        var graph = new UndirectedGraph(0);
        var result = sut.IsEulerian(graph);

        Assert.True(result.hasEulerianCycle);
    }

    [Fact]
    public void OneVerticeGraphIsEulerian()
    {
        var sut = new EulerianPath();
        var graph = new UndirectedGraph(1);
        var result = sut.IsEulerian(graph);

        Assert.True(result.hasEulerianCycle);
    }

    [Fact]
    public void TwoVerticeGraphIsSemiEulerian()
    {
        var sut = new EulerianPath();
        var graph = new UndirectedGraph(2);
        graph.Connect(0, 1);
        var result = sut.IsEulerian(graph);

        Assert.False(result.hasEulerianCycle);
        Assert.True(result.hasEulerianPath);
    }

    [Fact]
    public void ThreeVerticeGraphIsEulerian()
    {
        var sut = new EulerianPath();
        var graph = new UndirectedGraph(3);
        graph.Connect(0, 1);
        graph.Connect(1, 2);
        graph.Connect(2, 0);
        var result = sut.IsEulerian(graph);

        Assert.True(result.hasEulerianCycle);
    }

    [Fact]
    public void SemiEulerianGraph()
    {
        var sut = new EulerianPath();
        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);
        var result = sut.IsEulerian(graph);

        Assert.False(result.hasEulerianCycle);
        Assert.True(result.hasEulerianPath);
    }

    [Fact]
    public void FullEulerianGraph()
    {
        var sut = new EulerianPath();
        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);
        graph.Connect(4, 0);
        var result = sut.IsEulerian(graph);

        Assert.True(result.hasEulerianCycle);
    }

    [Fact]
    public void NonEulerianGraph()
    {
        var sut = new EulerianPath();
        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);
        graph.Connect(1, 3);
        var result = sut.IsEulerian(graph);

        Assert.False(result.hasEulerianCycle);
        Assert.False(result.hasEulerianPath);
    }

    [Fact]
    public void NonConnectedGraphIsNonEulerian()
    {
        var sut = new EulerianPath();
        var graph = new UndirectedGraph(5);
        var result = sut.IsEulerian(graph);

        Assert.False(result.hasEulerianCycle);
        Assert.False(result.hasEulerianPath);
    }
}