algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/Algorithm/Graph/BreadthFirstSearchTests.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
using System.Collections.Generic;
using AlgorithmsAndDataStructures.Algorithms.Graph.Search;
using AlgorithmsAndDataStructures.DataStructures.Graph;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph;

public class BreadthFirstSearchTests
{
    [Fact]
    public void OneNodeGraph()
    {
        var sut = new BreadthFirstSearch();
        var graph = new[]
        {
            new GraphVertex<int>
            {
                Value = 1
            }
        };
        Assert.Collection(sut.Traverse(graph), arg => Assert.Equal(1, arg));
    }

    [Fact]
    public void TwoNodesGraph()
    {
        var sut = new BreadthFirstSearch();
        var graph = new[]
        {
            new GraphVertex<int>
            {
                Value = 1,
                AdjacentVertices = new List<int>
                {
                    1
                }
            },
            new GraphVertex<int>
            {
                Value = 2
            }
        };
        Assert.Collection(sut.Traverse(graph), arg => Assert.Equal(1, arg), arg => Assert.Equal(2, arg));
    }

    [Fact]
    public void TwoNodesGraphWithCircularDependency()
    {
        var sut = new BreadthFirstSearch();
        var graph = new[]
        {
            new GraphVertex<int>
            {
                Value = 1,
                AdjacentVertices = new List<int>
                {
                    1
                }
            },
            new GraphVertex<int>
            {
                Value = 2,
                AdjacentVertices = new List<int>
                {
                    0
                }
            }
        };
        Assert.Collection(sut.Traverse(graph), arg => Assert.Equal(1, arg), arg => Assert.Equal(2, arg));
    }

    [Fact]
    public void BreadthFirstSearchTraversal()
    {
        var sut = new BreadthFirstSearch();
        var graph = new[]
        {
            new GraphVertex<int>
            {
                Value = 1,
                AdjacentVertices = new List<int>
                {
                    1, 2
                }
            },
            new GraphVertex<int>
            {
                Value = 2,
                AdjacentVertices = new List<int>
                {
                    3
                }
            },
            new GraphVertex<int>
            {
                Value = 3,
                AdjacentVertices = new List<int>()
            },
            new GraphVertex<int>
            {
                Value = 4,
                AdjacentVertices = new List<int>()
            }
        };
        Assert.Collection(sut.Traverse(graph),
            arg => Assert.Equal(1, arg),
            arg => Assert.Equal(2, arg),
            arg => Assert.Equal(3, arg),
            arg => Assert.Equal(4, arg));
    }
}