algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/KosarajusAlgorithmTests.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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
using System.Collections.Generic;
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.Misc;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph;

public class KosarajusAlgorithmTests
{
    [Fact]
    public void OneNodeGraphIsConnected()
    {
        var sut = new KosarajusAlgorithm();
        var graph = new[]
        {
            new WeightedGraphVertex()
        };

        Assert.True(sut.IsConnected(graph));
    }

    [Fact]
    public void TwoNodeConnectedGraphIsConnected()
    {
        var sut = new KosarajusAlgorithm();
        var graph = new[]
        {
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 0, To = 1 }
                }
            },
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 1, To = 0 }
                }
            }
        };

        Assert.True(sut.IsConnected(graph));
    }

    [Fact]
    public void TwoNodeDisconnectedGraphIsNotConnected()
    {
        var sut = new KosarajusAlgorithm();
        var graph = new[]
        {
            new WeightedGraphVertex(),
            new WeightedGraphVertex()
        };

        Assert.False(sut.IsConnected(graph));
    }

    [Fact]
    public void OneWayConnectedGraphIsNotConnected()
    {
        var sut = new KosarajusAlgorithm();
        var graph = new[]
        {
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 0, To = 1 }
                }
            },
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 1, To = 2 }
                }
            },
            new WeightedGraphVertex()
        };

        Assert.False(sut.IsConnected(graph));
    }

    [Fact]
    public void Baseline()
    {
        var sut = new KosarajusAlgorithm();
        var graph = new[]
        {
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 0, To = 1 }
                }
            },
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 1, To = 2 }
                }
            },
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 2, To = 3 },
                    new() { From = 2, To = 4 }
                }
            },
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 3, To = 0 }
                }
            },
            new WeightedGraphVertex
            {
                Edges = new List<WeightedGraphNodeEdge>
                {
                    new() { From = 4, To = 2 }
                }
            }
        };

        Assert.True(sut.IsConnected(graph));
    }
}