algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/MaxFlow/HopcroftKarpTests.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
using AlgorithmsAndDataStructures.Algorithms.Graph.MaximumFlow;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph.MaxFlow;

public class HopcroftKarpTests
{
    [Fact]
    public void Trivial()
    {
        var sut = new HopcroftKarp();
        var graph = new int[4][];

        graph[0] = new[] { 0, 1, 0, 0 };
        graph[1] = new[] { 1, 0, 0, 0 };
        graph[2] = new[] { 0, 0, 0, 1 };
        graph[3] = new[] { 0, 0, 1, 0 };

        Assert.Equal(2, sut.GetMaxMatching(graph));
    }

    [Fact]
    public void SimpleBaseline()
    {
        var sut = new HopcroftKarp();
        var graph = new int[4][];

        graph[0] = new[] { 0, 1, 0, 1 };
        graph[1] = new[] { 1, 0, 1, 0 };
        graph[2] = new[] { 0, 1, 0, 0 };
        graph[3] = new[] { 1, 0, 0, 0 };

        Assert.Equal(2, sut.GetMaxMatching(graph));
    }

    [Fact]
    public void ComplexBaseline()
    {
        var sut = new HopcroftKarp();
        var graph = new int[8][];

        graph[0] = new[] { 0, 1, 0, 1, 0, 0, 0, 1 };
        graph[1] = new[] { 1, 0, 1, 0, 0, 0, 1, 0 };
        graph[2] = new[] { 0, 1, 0, 0, 0, 0, 0, 0 };
        graph[3] = new[] { 1, 0, 0, 0, 1, 0, 0, 0 };
        graph[4] = new[] { 0, 0, 0, 1, 0, 0, 0, 0 };
        graph[5] = new[] { 0, 0, 0, 0, 0, 0, 1, 0 };
        graph[6] = new[] { 0, 1, 0, 1, 0, 1, 0, 1 };
        graph[7] = new[] { 1, 0, 0, 0, 0, 0, 1, 0 };

        Assert.Equal(4, sut.GetMaxMatching(graph));
    }
}