algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/DataStructures/Graph/AdjacencyListGraphTests.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
using AlgorithmsAndDataStructures.DataStructures.Graph;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.DataStructures.Graph;

public class AdjacencyListGraphTests
{
    [Fact]
    public void DfsNonRecursive()
    {
        var sut = new AdjacencyListGraph<int>();
        sut.AddEdge(0, 1);
        sut.AddEdge(0, 3);
        sut.AddEdge(1, 2);
        sut.AddEdge(3, 4);
        sut.AddEdge(4, 5);

        var dfs = sut.DepthFirstSearch();

        for (var i = 0; i < 6; i++) Assert.Equal(i, dfs[i]);
    }

    [Fact]
    public void DfsRecursive()
    {
        var sut = new AdjacencyListGraph<int>();
        sut.AddEdge(0, 1);
        sut.AddEdge(0, 3);
        sut.AddEdge(1, 2);
        sut.AddEdge(3, 4);
        sut.AddEdge(4, 5);

        var dfs = sut.DepthFirstSearch();

        for (var i = 0; i < 6; i++) Assert.Equal(i, dfs[i]);
    }

    [Fact]
    public void BfsNonRecursive()
    {
        var sut = new AdjacencyListGraph<int>();
        sut.AddEdge(0, 1);
        sut.AddEdge(0, 3);
        sut.AddEdge(1, 2);
        sut.AddEdge(3, 4);
        sut.AddEdge(4, 5);

        var bfs = sut.BreadthFirstSearch();

        Assert.Equal(0, bfs[0]);
        Assert.Equal(1, bfs[1]);
        Assert.Equal(3, bfs[2]);
        Assert.Equal(2, bfs[3]);
        Assert.Equal(4, bfs[4]);
        Assert.Equal(5, bfs[5]);
    }
}