test/bpgraph_test.cc
author Balazs Dezso <deba@inf.elte.hu>
Mon, 15 Nov 2010 09:46:08 +0100
changeset 1189 a12cca3ad15a
parent 1188 5ef0ab7b61cd
child 1193 c8fa41fcc4a7
permissions -rw-r--r--
ListBpGraph implementation (#69)
deba@1186
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@1186
     2
 *
deba@1186
     3
 * This file is a part of LEMON, a generic C++ optimization library.
deba@1186
     4
 *
deba@1186
     5
 * Copyright (C) 2003-2010
deba@1186
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@1186
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@1186
     8
 *
deba@1186
     9
 * Permission to use, modify and distribute this software is granted
deba@1186
    10
 * provided that this copyright notice appears in all copies. For
deba@1186
    11
 * precise terms see the accompanying LICENSE file.
deba@1186
    12
 *
deba@1186
    13
 * This software is provided "AS IS" with no warranty of any kind,
deba@1186
    14
 * express or implied, and with no claim as to its suitability for any
deba@1186
    15
 * purpose.
deba@1186
    16
 *
deba@1186
    17
 */
deba@1186
    18
deba@1186
    19
#include <lemon/concepts/bpgraph.h>
deba@1189
    20
#include <lemon/list_graph.h>
deba@1187
    21
#include <lemon/smart_graph.h>
deba@1188
    22
#include <lemon/full_graph.h>
deba@1186
    23
deba@1186
    24
#include "test_tools.h"
deba@1186
    25
#include "graph_test.h"
deba@1186
    26
deba@1186
    27
using namespace lemon;
deba@1186
    28
using namespace lemon::concepts;
deba@1186
    29
deba@1187
    30
template <class BpGraph>
deba@1187
    31
void checkBpGraphBuild() {
deba@1187
    32
  TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph);
deba@1187
    33
deba@1187
    34
  BpGraph G;
deba@1187
    35
  checkGraphNodeList(G, 0);
deba@1187
    36
  checkGraphRedNodeList(G, 0);
deba@1187
    37
  checkGraphBlueNodeList(G, 0);
deba@1187
    38
  checkGraphEdgeList(G, 0);
deba@1187
    39
  checkGraphArcList(G, 0);
deba@1187
    40
deba@1187
    41
  G.reserveNode(3);
deba@1187
    42
  G.reserveEdge(3);
deba@1187
    43
deba@1187
    44
  Node
deba@1187
    45
    rn1 = G.addRedNode();
deba@1187
    46
  checkGraphNodeList(G, 1);
deba@1187
    47
  checkGraphRedNodeList(G, 1);
deba@1187
    48
  checkGraphBlueNodeList(G, 0);
deba@1187
    49
  checkGraphEdgeList(G, 0);
deba@1187
    50
  checkGraphArcList(G, 0);
deba@1187
    51
deba@1187
    52
  Node
deba@1187
    53
    bn1 = G.addBlueNode(),
deba@1187
    54
    bn2 = G.addBlueNode();
deba@1187
    55
  checkGraphNodeList(G, 3);
deba@1187
    56
  checkGraphRedNodeList(G, 1);
deba@1187
    57
  checkGraphBlueNodeList(G, 2);
deba@1187
    58
  checkGraphEdgeList(G, 0);
deba@1187
    59
  checkGraphArcList(G, 0);
deba@1187
    60
deba@1187
    61
  Edge e1 = G.addEdge(rn1, bn2);
deba@1187
    62
  check(G.redNode(e1) == rn1 && G.blueNode(e1) == bn2, "Wrong edge");
deba@1187
    63
  check(G.u(e1) == rn1 && G.v(e1) == bn2, "Wrong edge");
deba@1187
    64
deba@1187
    65
  checkGraphNodeList(G, 3);
deba@1187
    66
  checkGraphRedNodeList(G, 1);
deba@1187
    67
  checkGraphBlueNodeList(G, 2);
deba@1187
    68
  checkGraphEdgeList(G, 1);
deba@1187
    69
  checkGraphArcList(G, 2);
deba@1187
    70
deba@1187
    71
  checkGraphIncEdgeArcLists(G, rn1, 1);
deba@1187
    72
  checkGraphIncEdgeArcLists(G, bn1, 0);
deba@1187
    73
  checkGraphIncEdgeArcLists(G, bn2, 1);
deba@1187
    74
deba@1187
    75
  checkGraphConEdgeList(G, 1);
deba@1187
    76
  checkGraphConArcList(G, 2);
deba@1187
    77
deba@1187
    78
  Edge
deba@1187
    79
    e2 = G.addEdge(rn1, bn1),
deba@1187
    80
    e3 = G.addEdge(rn1, bn2);
deba@1187
    81
deba@1187
    82
  checkGraphNodeList(G, 3);
deba@1187
    83
  checkGraphRedNodeList(G, 1);
deba@1187
    84
  checkGraphBlueNodeList(G, 2);
deba@1187
    85
  checkGraphEdgeList(G, 3);
deba@1187
    86
  checkGraphArcList(G, 6);
deba@1187
    87
deba@1187
    88
  checkGraphIncEdgeArcLists(G, rn1, 3);
deba@1187
    89
  checkGraphIncEdgeArcLists(G, bn1, 1);
deba@1187
    90
  checkGraphIncEdgeArcLists(G, bn2, 2);
deba@1187
    91
deba@1187
    92
  checkGraphConEdgeList(G, 3);
deba@1187
    93
  checkGraphConArcList(G, 6);
deba@1187
    94
deba@1187
    95
  checkArcDirections(G);
deba@1187
    96
deba@1187
    97
  checkNodeIds(G);
deba@1187
    98
  checkRedNodeIds(G);
deba@1187
    99
  checkBlueNodeIds(G);
deba@1187
   100
  checkArcIds(G);
deba@1187
   101
  checkEdgeIds(G);
deba@1187
   102
deba@1187
   103
  checkGraphNodeMap(G);
deba@1187
   104
  checkGraphRedMap(G);
deba@1187
   105
  checkGraphBlueMap(G);
deba@1187
   106
  checkGraphArcMap(G);
deba@1187
   107
  checkGraphEdgeMap(G);
deba@1187
   108
}
deba@1187
   109
deba@1189
   110
template <class BpGraph>
deba@1189
   111
void checkBpGraphErase() {
deba@1189
   112
  TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph);
deba@1189
   113
deba@1189
   114
  BpGraph G;
deba@1189
   115
  Node
deba@1189
   116
    n1 = G.addRedNode(), n2 = G.addBlueNode(),
deba@1189
   117
    n3 = G.addBlueNode(), n4 = G.addRedNode();
deba@1189
   118
  Edge
deba@1189
   119
    e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3),
deba@1189
   120
    e3 = G.addEdge(n4, n2), e4 = G.addEdge(n4, n3);
deba@1189
   121
deba@1189
   122
  // Check edge deletion
deba@1189
   123
  G.erase(e2);
deba@1189
   124
deba@1189
   125
  checkGraphNodeList(G, 4);
deba@1189
   126
  checkGraphRedNodeList(G, 2);
deba@1189
   127
  checkGraphBlueNodeList(G, 2);
deba@1189
   128
  checkGraphEdgeList(G, 3);
deba@1189
   129
  checkGraphArcList(G, 6);
deba@1189
   130
deba@1189
   131
  checkGraphIncEdgeArcLists(G, n1, 1);
deba@1189
   132
  checkGraphIncEdgeArcLists(G, n2, 2);
deba@1189
   133
  checkGraphIncEdgeArcLists(G, n3, 1);
deba@1189
   134
  checkGraphIncEdgeArcLists(G, n4, 2);
deba@1189
   135
deba@1189
   136
  checkGraphConEdgeList(G, 3);
deba@1189
   137
  checkGraphConArcList(G, 6);
deba@1189
   138
deba@1189
   139
  // Check node deletion
deba@1189
   140
  G.erase(n3);
deba@1189
   141
deba@1189
   142
  checkGraphNodeList(G, 3);
deba@1189
   143
  checkGraphRedNodeList(G, 2);
deba@1189
   144
  checkGraphBlueNodeList(G, 1);
deba@1189
   145
  checkGraphEdgeList(G, 2);
deba@1189
   146
  checkGraphArcList(G, 4);
deba@1189
   147
deba@1189
   148
  checkGraphIncEdgeArcLists(G, n1, 1);
deba@1189
   149
  checkGraphIncEdgeArcLists(G, n2, 2);
deba@1189
   150
  checkGraphIncEdgeArcLists(G, n4, 1);
deba@1189
   151
deba@1189
   152
  checkGraphConEdgeList(G, 2);
deba@1189
   153
  checkGraphConArcList(G, 4);
deba@1189
   154
deba@1189
   155
}
deba@1189
   156
deba@1189
   157
template <class BpGraph>
deba@1189
   158
void checkBpGraphAlter() {
deba@1189
   159
  TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph);
deba@1189
   160
deba@1189
   161
  BpGraph G;
deba@1189
   162
  Node
deba@1189
   163
    n1 = G.addRedNode(), n2 = G.addBlueNode(),
deba@1189
   164
    n3 = G.addBlueNode(), n4 = G.addRedNode();
deba@1189
   165
  Edge
deba@1189
   166
    e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3),
deba@1189
   167
    e3 = G.addEdge(n4, n2), e4 = G.addEdge(n4, n3);
deba@1189
   168
deba@1189
   169
  G.changeRed(e2, n4);
deba@1189
   170
  check(G.redNode(e2) == n4, "Wrong red node");
deba@1189
   171
  check(G.blueNode(e2) == n3, "Wrong blue node");
deba@1189
   172
deba@1189
   173
  checkGraphNodeList(G, 4);
deba@1189
   174
  checkGraphRedNodeList(G, 2);
deba@1189
   175
  checkGraphBlueNodeList(G, 2);
deba@1189
   176
  checkGraphEdgeList(G, 4);
deba@1189
   177
  checkGraphArcList(G, 8);
deba@1189
   178
deba@1189
   179
  checkGraphIncEdgeArcLists(G, n1, 1);
deba@1189
   180
  checkGraphIncEdgeArcLists(G, n2, 2);
deba@1189
   181
  checkGraphIncEdgeArcLists(G, n3, 2);
deba@1189
   182
  checkGraphIncEdgeArcLists(G, n4, 3);
deba@1189
   183
deba@1189
   184
  checkGraphConEdgeList(G, 4);
deba@1189
   185
  checkGraphConArcList(G, 8);
deba@1189
   186
deba@1189
   187
  G.changeBlue(e2, n2);
deba@1189
   188
  check(G.redNode(e2) == n4, "Wrong red node");
deba@1189
   189
  check(G.blueNode(e2) == n2, "Wrong blue node");
deba@1189
   190
deba@1189
   191
  checkGraphNodeList(G, 4);
deba@1189
   192
  checkGraphRedNodeList(G, 2);
deba@1189
   193
  checkGraphBlueNodeList(G, 2);
deba@1189
   194
  checkGraphEdgeList(G, 4);
deba@1189
   195
  checkGraphArcList(G, 8);
deba@1189
   196
deba@1189
   197
  checkGraphIncEdgeArcLists(G, n1, 1);
deba@1189
   198
  checkGraphIncEdgeArcLists(G, n2, 3);
deba@1189
   199
  checkGraphIncEdgeArcLists(G, n3, 1);
deba@1189
   200
  checkGraphIncEdgeArcLists(G, n4, 3);
deba@1189
   201
deba@1189
   202
  checkGraphConEdgeList(G, 4);
deba@1189
   203
  checkGraphConArcList(G, 8);
deba@1189
   204
}
deba@1189
   205
deba@1189
   206
deba@1189
   207
template <class BpGraph>
deba@1187
   208
void checkBpGraphSnapshot() {
deba@1189
   209
  TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph);
deba@1187
   210
deba@1189
   211
  BpGraph G;
deba@1187
   212
  Node 
deba@1187
   213
    n1 = G.addRedNode(),
deba@1187
   214
    n2 = G.addBlueNode(),
deba@1187
   215
    n3 = G.addBlueNode();
deba@1187
   216
  Edge 
deba@1187
   217
    e1 = G.addEdge(n1, n2),
deba@1187
   218
    e2 = G.addEdge(n1, n3);
deba@1187
   219
deba@1187
   220
  checkGraphNodeList(G, 3);
deba@1187
   221
  checkGraphRedNodeList(G, 1);
deba@1187
   222
  checkGraphBlueNodeList(G, 2);
deba@1187
   223
  checkGraphEdgeList(G, 2);
deba@1187
   224
  checkGraphArcList(G, 4);
deba@1187
   225
deba@1189
   226
  typename BpGraph::Snapshot snapshot(G);
deba@1187
   227
deba@1187
   228
  Node n4 = G.addRedNode();
deba@1187
   229
  G.addEdge(n4, n2);
deba@1187
   230
  G.addEdge(n4, n3);
deba@1187
   231
deba@1187
   232
  checkGraphNodeList(G, 4);
deba@1187
   233
  checkGraphRedNodeList(G, 2);
deba@1187
   234
  checkGraphBlueNodeList(G, 2);
deba@1187
   235
  checkGraphEdgeList(G, 4);
deba@1187
   236
  checkGraphArcList(G, 8);
deba@1187
   237
deba@1187
   238
  snapshot.restore();
deba@1187
   239
deba@1187
   240
  checkGraphNodeList(G, 3);
deba@1187
   241
  checkGraphRedNodeList(G, 1);
deba@1187
   242
  checkGraphBlueNodeList(G, 2);
deba@1187
   243
  checkGraphEdgeList(G, 2);
deba@1187
   244
  checkGraphArcList(G, 4);
deba@1187
   245
deba@1187
   246
  checkGraphIncEdgeArcLists(G, n1, 2);
deba@1187
   247
  checkGraphIncEdgeArcLists(G, n2, 1);
deba@1187
   248
  checkGraphIncEdgeArcLists(G, n3, 1);
deba@1187
   249
deba@1187
   250
  checkGraphConEdgeList(G, 2);
deba@1187
   251
  checkGraphConArcList(G, 4);
deba@1187
   252
deba@1187
   253
  checkNodeIds(G);
deba@1187
   254
  checkRedNodeIds(G);
deba@1187
   255
  checkBlueNodeIds(G);
deba@1187
   256
  checkArcIds(G);
deba@1187
   257
  checkEdgeIds(G);
deba@1187
   258
deba@1187
   259
  checkGraphNodeMap(G);
deba@1187
   260
  checkGraphRedMap(G);
deba@1187
   261
  checkGraphBlueMap(G);
deba@1187
   262
  checkGraphArcMap(G);
deba@1187
   263
  checkGraphEdgeMap(G);
deba@1187
   264
deba@1187
   265
  G.addRedNode();
deba@1187
   266
  snapshot.save(G);
deba@1187
   267
deba@1187
   268
  G.addEdge(G.addRedNode(), G.addBlueNode());
deba@1187
   269
deba@1187
   270
  snapshot.restore();
deba@1187
   271
  snapshot.save(G);
deba@1187
   272
deba@1187
   273
  checkGraphNodeList(G, 4);
deba@1187
   274
  checkGraphRedNodeList(G, 2);
deba@1187
   275
  checkGraphBlueNodeList(G, 2);
deba@1187
   276
  checkGraphEdgeList(G, 2);
deba@1187
   277
  checkGraphArcList(G, 4);
deba@1187
   278
deba@1187
   279
  G.addEdge(G.addRedNode(), G.addBlueNode());
deba@1187
   280
deba@1187
   281
  snapshot.restore();
deba@1187
   282
deba@1187
   283
  checkGraphNodeList(G, 4);
deba@1187
   284
  checkGraphRedNodeList(G, 2);
deba@1187
   285
  checkGraphBlueNodeList(G, 2);
deba@1187
   286
  checkGraphEdgeList(G, 2);
deba@1187
   287
  checkGraphArcList(G, 4);
deba@1187
   288
}
deba@1187
   289
deba@1189
   290
template <typename BpGraph>
deba@1187
   291
void checkBpGraphValidity() {
deba@1189
   292
  TEMPLATE_BPGRAPH_TYPEDEFS(BpGraph);
deba@1189
   293
  BpGraph g;
deba@1187
   294
deba@1187
   295
  Node
deba@1187
   296
    n1 = g.addRedNode(),
deba@1187
   297
    n2 = g.addBlueNode(),
deba@1187
   298
    n3 = g.addBlueNode();
deba@1187
   299
deba@1187
   300
  Edge
deba@1187
   301
    e1 = g.addEdge(n1, n2),
deba@1187
   302
    e2 = g.addEdge(n1, n3);
deba@1187
   303
deba@1187
   304
  check(g.valid(n1), "Wrong validity check");
deba@1187
   305
  check(g.valid(e1), "Wrong validity check");
deba@1187
   306
  check(g.valid(g.direct(e1, true)), "Wrong validity check");
deba@1187
   307
deba@1187
   308
  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
deba@1187
   309
  check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
deba@1187
   310
  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@1187
   311
}
deba@1187
   312
deba@1186
   313
void checkConcepts() {
deba@1186
   314
  { // Checking graph components
deba@1186
   315
    checkConcept<BaseBpGraphComponent, BaseBpGraphComponent >();
deba@1186
   316
deba@1186
   317
    checkConcept<IDableBpGraphComponent<>,
deba@1186
   318
      IDableBpGraphComponent<> >();
deba@1186
   319
deba@1186
   320
    checkConcept<IterableBpGraphComponent<>,
deba@1186
   321
      IterableBpGraphComponent<> >();
deba@1186
   322
deba@1186
   323
    checkConcept<AlterableBpGraphComponent<>,
deba@1186
   324
      AlterableBpGraphComponent<> >();
deba@1186
   325
deba@1186
   326
    checkConcept<MappableBpGraphComponent<>,
deba@1186
   327
      MappableBpGraphComponent<> >();
deba@1186
   328
deba@1186
   329
    checkConcept<ExtendableBpGraphComponent<>,
deba@1186
   330
      ExtendableBpGraphComponent<> >();
deba@1186
   331
deba@1186
   332
    checkConcept<ErasableBpGraphComponent<>,
deba@1186
   333
      ErasableBpGraphComponent<> >();
deba@1186
   334
deba@1187
   335
    checkConcept<ClearableBpGraphComponent<>,
deba@1187
   336
      ClearableBpGraphComponent<> >();
deba@1186
   337
deba@1186
   338
  }
deba@1186
   339
  { // Checking skeleton graph
deba@1186
   340
    checkConcept<BpGraph, BpGraph>();
deba@1186
   341
  }
deba@1187
   342
  { // Checking SmartBpGraph
deba@1187
   343
    checkConcept<BpGraph, SmartBpGraph>();
deba@1187
   344
    checkConcept<AlterableBpGraphComponent<>, SmartBpGraph>();
deba@1187
   345
    checkConcept<ExtendableBpGraphComponent<>, SmartBpGraph>();
deba@1187
   346
    checkConcept<ClearableBpGraphComponent<>, SmartBpGraph>();
deba@1187
   347
  }
deba@1186
   348
}
deba@1186
   349
deba@1188
   350
void checkFullBpGraph(int redNum, int blueNum) {
deba@1188
   351
  typedef FullBpGraph BpGraph;
deba@1188
   352
  BPGRAPH_TYPEDEFS(BpGraph);
deba@1188
   353
deba@1188
   354
  BpGraph G(redNum, blueNum);
deba@1188
   355
  checkGraphNodeList(G, redNum + blueNum);
deba@1188
   356
  checkGraphRedNodeList(G, redNum);
deba@1188
   357
  checkGraphBlueNodeList(G, blueNum);
deba@1188
   358
  checkGraphEdgeList(G, redNum * blueNum);
deba@1188
   359
  checkGraphArcList(G, 2 * redNum * blueNum);
deba@1188
   360
deba@1188
   361
  G.resize(redNum, blueNum);
deba@1188
   362
  checkGraphNodeList(G, redNum + blueNum);
deba@1188
   363
  checkGraphRedNodeList(G, redNum);
deba@1188
   364
  checkGraphBlueNodeList(G, blueNum);
deba@1188
   365
  checkGraphEdgeList(G, redNum * blueNum);
deba@1188
   366
  checkGraphArcList(G, 2 * redNum * blueNum);
deba@1188
   367
deba@1188
   368
  for (RedIt n(G); n != INVALID; ++n) {
deba@1188
   369
    checkGraphOutArcList(G, n, blueNum);
deba@1188
   370
    checkGraphInArcList(G, n, blueNum);
deba@1188
   371
    checkGraphIncEdgeList(G, n, blueNum);
deba@1188
   372
  }
deba@1188
   373
deba@1188
   374
  for (BlueIt n(G); n != INVALID; ++n) {
deba@1188
   375
    checkGraphOutArcList(G, n, redNum);
deba@1188
   376
    checkGraphInArcList(G, n, redNum);
deba@1188
   377
    checkGraphIncEdgeList(G, n, redNum);
deba@1188
   378
  }
deba@1188
   379
deba@1188
   380
  checkGraphConArcList(G, 2 * redNum * blueNum);
deba@1188
   381
  checkGraphConEdgeList(G, redNum * blueNum);
deba@1188
   382
deba@1188
   383
  checkArcDirections(G);
deba@1188
   384
deba@1188
   385
  checkNodeIds(G);
deba@1188
   386
  checkRedNodeIds(G);
deba@1188
   387
  checkBlueNodeIds(G);
deba@1188
   388
  checkArcIds(G);
deba@1188
   389
  checkEdgeIds(G);
deba@1188
   390
deba@1188
   391
  checkGraphNodeMap(G);
deba@1188
   392
  checkGraphRedMap(G);
deba@1188
   393
  checkGraphBlueMap(G);
deba@1188
   394
  checkGraphArcMap(G);
deba@1188
   395
  checkGraphEdgeMap(G);
deba@1188
   396
deba@1188
   397
  for (int i = 0; i < G.redNum(); ++i) {
deba@1188
   398
    check(G.red(G.redNode(i)), "Wrong node");
deba@1188
   399
    check(G.redIndex(G.redNode(i)) == i, "Wrong index");
deba@1188
   400
  }
deba@1188
   401
deba@1188
   402
  for (int i = 0; i < G.blueNum(); ++i) {
deba@1188
   403
    check(G.blue(G.blueNode(i)), "Wrong node");
deba@1188
   404
    check(G.blueIndex(G.blueNode(i)) == i, "Wrong index");
deba@1188
   405
  }
deba@1188
   406
deba@1188
   407
  for (NodeIt u(G); u != INVALID; ++u) {
deba@1188
   408
    for (NodeIt v(G); v != INVALID; ++v) {
deba@1188
   409
      Edge e = G.edge(u, v);
deba@1188
   410
      Arc a = G.arc(u, v);
deba@1188
   411
      if (G.red(u) == G.red(v)) {
deba@1188
   412
        check(e == INVALID, "Wrong edge lookup");
deba@1188
   413
        check(a == INVALID, "Wrong arc lookup");
deba@1188
   414
      } else {
deba@1188
   415
        check((G.u(e) == u && G.v(e) == v) ||
deba@1188
   416
              (G.u(e) == v && G.v(e) == u), "Wrong edge lookup");
deba@1188
   417
        check(G.source(a) == u && G.target(a) == v, "Wrong arc lookup");
deba@1188
   418
      }
deba@1188
   419
    }
deba@1188
   420
  }
deba@1188
   421
deba@1188
   422
}
deba@1188
   423
deba@1186
   424
void checkGraphs() {
deba@1189
   425
  { // Checking ListGraph
deba@1189
   426
    checkBpGraphBuild<ListBpGraph>();
deba@1189
   427
    checkBpGraphErase<ListBpGraph>();
deba@1189
   428
    checkBpGraphAlter<ListBpGraph>();
deba@1189
   429
    checkBpGraphSnapshot<ListBpGraph>();
deba@1189
   430
    checkBpGraphValidity<ListBpGraph>();
deba@1189
   431
  }
deba@1187
   432
  { // Checking SmartGraph
deba@1187
   433
    checkBpGraphBuild<SmartBpGraph>();
deba@1187
   434
    checkBpGraphSnapshot<SmartBpGraph>();
deba@1187
   435
    checkBpGraphValidity<SmartBpGraph>();
deba@1187
   436
  }
deba@1188
   437
  { // Checking FullBpGraph
deba@1188
   438
    checkFullBpGraph(6, 8);
deba@1188
   439
    checkFullBpGraph(7, 4);
deba@1188
   440
  }
deba@1186
   441
}
deba@1186
   442
deba@1186
   443
int main() {
deba@1186
   444
  checkConcepts();
deba@1186
   445
  checkGraphs();
deba@1186
   446
  return 0;
deba@1186
   447
}