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

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph.MaxFlow;

public class FordFulkersonWithCapacityHeuristicTests
{
    [Fact]
    public void BaselineWithZigZagPath()
    {
        var sut = new FordFulkersonWithCapacityHeuristic();
        var graph = new int[4][];

        for (var i = 0; i < graph.Length; i++) graph[i] = new int[4];

        graph[0][1] = 3;
        graph[0][2] = 2;
        graph[1][2] = 5;
        graph[1][3] = 2;
        graph[2][3] = 3;

        Assert.Equal(5, sut.MaxFlow(graph));
    }

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

        for (var i = 0; i < graph.Length; i++) graph[i] = new int[4];

        graph[0][1] = 3;
        graph[0][2] = 2;
        graph[1][3] = 2;
        graph[2][3] = 3;

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

    [Fact]
    public void Baseline()
    {
        var sut = new FordFulkersonWithCapacityHeuristic();
        var graph = new int[6][];

        graph[0] = new[] { 0, 16, 13, 0, 0, 0 };
        graph[1] = new[] { 0, 0, 10, 12, 0, 0 };
        graph[2] = new[] { 0, 4, 0, 0, 14, 0 };
        graph[3] = new[] { 0, 0, 9, 0, 0, 20 };
        graph[4] = new[] { 0, 0, 0, 7, 0, 4 };
        graph[5] = new[] { 0, 0, 0, 0, 0, 0 };

        Assert.Equal(23, sut.MaxFlow(graph));
    }
}