algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/Backtracking/HamiltonianCycle.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
using AlgorithmsAndDataStructures.Algorithms.Graph.Backtracking;
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph.Backtracking;

public class HamiltonianCycleTest
{
    [Fact]
    public void Baseline()
    {
        var sut = new HamiltonPath();
        var graph = new UndirectedGraph(5);
        graph.Connect(0, 1);
        graph.Connect(0, 3);
        graph.Connect(1, 2);
        graph.Connect(1, 3);
        graph.Connect(1, 4);
        graph.Connect(2, 4);
        graph.Connect(3, 4);

        var (hasPath, hasCycle, path) = sut.HasHamiltonPath(graph);

        Assert.True(hasCycle);
        Assert.True(hasPath);
#pragma warning disable HAA0101 // Array allocation for params parameter
        Assert.Collection(path,
            arg => Assert.Equal(0, arg),
            arg => Assert.Equal(1, arg),
            arg => Assert.Equal(2, arg),
            arg => Assert.Equal(4, arg),
            arg => Assert.Equal(3, arg),
            arg => Assert.Equal(0, arg));
#pragma warning restore HAA0101 // Array allocation for params parameter
    }

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

        var (hasPath, hasCycle, _) = sut.HasHamiltonPath(graph);

        Assert.False(hasCycle);
        Assert.True(hasPath);
    }

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

        var (hasPath, hasCycle, _) = sut.HasHamiltonPath(graph);

        Assert.False(hasCycle);
        Assert.False(hasPath);
    }
}