Lab_1/time_research.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
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
#include <chrono>
#include <iostream>
#include <random>
#include "gtest/gtest.h"
#include "traffic_manager.h"
#include "graph.h"
#include "clique.h"
#include "chain.h"

const long long kTimeConstant = 1'000'000;
const int kIterations = 100'000;
const int kMaxValue = 1'000'000;
const int kMaxWeight = 1'000;
// const int kSizes = 5;
// const int graph_sizes[kSizes] = {10, 20, 50, 100, 200};
const int kSizes = 1;
const int graph_sizes[kSizes] = {500};

TEST(Time, FullyConnectedGraph) {
  std::mt19937 graph_random(416);

  for (int size_type = 0; size_type < kSizes; size_type++) {
    long long start_time = std::chrono::system_clock().now().time_since_epoch().count();

    int n = graph_sizes[size_type];
    Graph graph(n);

    std::vector<int> ones(n, 1);
    TrafficManager manager(&graph, ones, ones, 1);

    for (int i = 0; i < kIterations; i++) {
      int from = graph_random() % n;
      int to = graph_random() % n;
      while (from == to) {
        to = graph_random() % n;
      }
      int count = (graph_random() % n) + 1;

      manager.Transport(from, to, count);
    }

    long long end_time = std::chrono::system_clock().now().time_since_epoch().count();
    std::cout << "for graph with size " << n << " time is " <<
              (end_time - start_time) / kTimeConstant << " ms\n";
  }
}

TEST(Time, Clique) {
  std::mt19937 graph_random(416);

  for (int size_type = 0; size_type < kSizes; size_type++) {
    long long start_time = std::chrono::system_clock().now().time_since_epoch().count();

    int n = graph_sizes[size_type];
    Clique graph(n);

    std::vector<int> ones(n, 1);
    TrafficManager manager(&graph, ones, ones, 1);

    for (int i = 0; i < kIterations; i++) {
      int from = graph_random() % n;
      int to = graph_random() % n;
      while (from == to) {
        to = graph_random() % n;
      }
      int count = (graph_random() % n) + 1;

      manager.Transport(from, to, count);
    }

    long long end_time = std::chrono::system_clock().now().time_since_epoch().count();
    std::cout << "for clique with size " << n << " time is " <<
              (end_time - start_time) / kTimeConstant << " ms\n";
  }
}

TEST(Time, Chain) {
  std::mt19937 graph_random(416);

  for (int size_type = 0; size_type < kSizes; size_type++) {
    long long start_time = std::chrono::system_clock().now().time_since_epoch().count();

    int n = graph_sizes[size_type];
    Chain graph(n);

    std::vector<int> big(n, kMaxValue);
    ChainTrafficManager manager(&graph, big, big, 1);

    for (int i = 0; i < kIterations; i++) {
      int from = graph_random() % n;
      int to = graph_random() % n;
      while (from == to) {
        to = graph_random() % n;
      }
      if (from > to) {
        std::swap(from, to);
      }

      manager.Transport(from, to, 1);
    }

    long long end_time = std::chrono::system_clock().now().time_since_epoch().count();
    std::cout << "for chain with size " << n << " time is " <<
              (end_time - start_time) / kTimeConstant << " ms\n";
  }
}


TEST(Time, RandomFullyConnectedGraph) {
  std::mt19937 graph_random(416);

  for (int size_type = 0; size_type < kSizes; size_type++) {
    long long start_time = std::chrono::system_clock().now().time_since_epoch().count();

    int n = graph_sizes[size_type];
    std::vector<std::vector<AbstractGraph::Edge>> connections;
    connections.resize(n);

    for (int i = 0; i < n; i++) {
      connections[i].resize(n);
      connections[i][i] = AbstractGraph::Edge(i, 0);

      for (int j = 0; j < i; j++) {
        int weight = (graph_random() % kMaxWeight) + 1;

        connections[i][j] = AbstractGraph::Edge(j, weight);
        connections[j][i] = AbstractGraph::Edge(i, weight);
      }
    }

    Graph graph(connections);

    std::vector<int> ones(n, 1);
    TrafficManager manager(&graph, ones, ones, 1);

    for (int i = 0; i < kIterations; i++) {
      int from = graph_random() % n;
      int to = graph_random() % n;
      while (from == to) {
        to = graph_random() % n;
      }
      int count = (graph_random() % n) + 1;

      manager.Transport(from, to, count);
    }

    long long end_time = std::chrono::system_clock().now().time_since_epoch().count();
    std::cout << "for random graph with size " << n << " time is " <<
              (end_time - start_time) / kTimeConstant << " ms\n";
  }
}

TEST(Time, RandomClique) {
  std::mt19937 graph_random(416);

  for (int size_type = 0; size_type < kSizes; size_type++) {
    long long start_time = std::chrono::system_clock().now().time_since_epoch().count();

    int n = graph_sizes[size_type];
    std::vector<std::vector<AbstractGraph::Edge>> connections;
    connections.resize(n);

    for (int i = 0; i < n; i++) {
      connections[i].resize(n);
      connections[i][i] = AbstractGraph::Edge(i, 0);

      for (int j = 0; j < i; j++) {
        int weight = (graph_random() % kMaxWeight) + 1;

        connections[i][j] = AbstractGraph::Edge(j, weight);
        connections[j][i] = AbstractGraph::Edge(i, weight);
      }
    }

    Clique graph(connections);

    std::vector<int> ones(n, 1);
    TrafficManager manager(&graph, ones, ones, 1);

    for (int i = 0; i < kIterations; i++) {
      int from = graph_random() % n;
      int to = graph_random() % n;
      while (from == to) {
        to = graph_random() % n;
      }
      int count = (graph_random() % n) + 1;

      manager.Transport(from, to, count);
    }

    long long end_time = std::chrono::system_clock().now().time_since_epoch().count();
    std::cout << "for random clique with size " << n << " time is " <<
              (end_time - start_time) / kTimeConstant << " ms\n";
  }
}

TEST(Time, RandomChain) {
  std::mt19937 graph_random(416);

  for (int size_type = 0; size_type < kSizes; size_type++) {
    long long start_time = std::chrono::system_clock().now().time_since_epoch().count();

    int n = graph_sizes[size_type];
    std::vector<std::vector<AbstractGraph::Edge>> connections;
    connections.resize(n);

    for (int i = 0; i < n; i++) {
      if (i + 1 < n) {
        int weight = (graph_random() % kMaxWeight) + 1;
        connections[i].push_back(AbstractGraph::Edge(i + 1, weight));
      }
    }

    Chain graph(connections);

    std::vector<int> big(n, kMaxValue);
    ChainTrafficManager manager(&graph, big, big, 1);

    for (int i = 0; i < kIterations; i++) {
      int from = graph_random() % n;
      int to = graph_random() % n;
      while (from == to) {
        to = graph_random() % n;
      }
      if (from > to) {
        std::swap(from, to);
      }

      manager.Transport(from, to, 1);
    }

    long long end_time = std::chrono::system_clock().now().time_since_epoch().count();
    std::cout << "for random chain with size " << n << " time is " <<
              (end_time - start_time) / kTimeConstant << " ms\n";
  }
}