Lab_1/chain_tests.cpp at master · Dmi4er4/Lab_1 · 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
#include "chain.h"
#include "gtest/gtest.h"

TEST(Chain, Constructors) {
  const int kMaxN = 100;

  for (int n = 1; n <= kMaxN; n++) {
    Chain graph(n);
    ASSERT_EQ(graph.GetSize(), n);

    for (int i = 0; i < n; i++) {
      int pointer = 0;
      const std::vector<AbstractGraph::Edge>& edges = graph.GetEdges(i);
      if (i == n - 1) {
        ASSERT_EQ(edges.size(), 0);
      } else {
        ASSERT_EQ(edges.size(), 1);
        ASSERT_EQ(edges[0].to, i + 1);
        ASSERT_EQ(edges[0].length, 1);
      }
    }
  }
}

TEST(Chain, GetPath) {
  const int kMaxN = 100;

  for (int n = 1; n <= kMaxN; n++) {
    Chain graph(n);
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) {
        std::vector<AbstractGraph::Edge> any_path = graph.GetAnyPath(i, j);
        std::vector<AbstractGraph::Edge>
            shortest_path = graph.GetShortestPath(i, j);
        std::vector<AbstractGraph::Edge> for_check;
        if (j >= i) {
          ASSERT_EQ(any_path.size(), j - i);
          ASSERT_EQ(shortest_path.size(), j - i);
          for (int k = i + 1; k <= j; k++) {
            ASSERT_EQ(any_path[k - i - 1].to, k);
            ASSERT_EQ(any_path[k - i - 1].length, 1);
            ASSERT_EQ(shortest_path[k - i - 1].to, k);
            ASSERT_EQ(shortest_path[k - i - 1].length, 1);
          }
        } else {
          ASSERT_EQ(any_path.size(), 0);
          ASSERT_EQ(shortest_path.size(), 0);
        }
      }
  }
}