test/graph_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Tue, 28 Oct 2008 21:35:06 +0100
changeset 344 236b1902e5cc
parent 335 160bf92c7cdc
child 356 99f1bdf8f7db
permissions -rw-r--r--
More improvement in the migration script

- Rename (U)GRAPH_TYPEDEFS.
- Rename "directed graph" to "digraph".
alpar@209
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@57
     2
 *
alpar@209
     3
 * This file is a part of LEMON, a generic C++ optimization library.
deba@57
     4
 *
alpar@107
     5
 * Copyright (C) 2003-2008
deba@57
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@57
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@57
     8
 *
deba@57
     9
 * Permission to use, modify and distribute this software is granted
deba@57
    10
 * provided that this copyright notice appears in all copies. For
deba@57
    11
 * precise terms see the accompanying LICENSE file.
deba@57
    12
 *
deba@57
    13
 * This software is provided "AS IS" with no warranty of any kind,
deba@57
    14
 * express or implied, and with no claim as to its suitability for any
deba@57
    15
 * purpose.
deba@57
    16
 *
deba@57
    17
 */
deba@57
    18
deba@57
    19
#include <lemon/concepts/graph.h>
deba@57
    20
#include <lemon/list_graph.h>
deba@109
    21
#include <lemon/smart_graph.h>
deba@57
    22
// #include <lemon/full_graph.h>
kpeter@334
    23
#include <lemon/grid_graph.h>
deba@57
    24
deba@57
    25
#include "test_tools.h"
kpeter@171
    26
#include "graph_test.h"
deba@57
    27
deba@57
    28
using namespace lemon;
deba@57
    29
using namespace lemon::concepts;
deba@57
    30
deba@228
    31
template <class Graph>
deba@228
    32
void checkGraph() {
deba@228
    33
  TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@228
    34
deba@228
    35
  Graph G;
deba@228
    36
  checkGraphNodeList(G, 0);
deba@228
    37
  checkGraphEdgeList(G, 0);
deba@228
    38
deba@228
    39
  Node
deba@228
    40
    n1 = G.addNode(),
deba@228
    41
    n2 = G.addNode(),
deba@228
    42
    n3 = G.addNode();
deba@228
    43
  checkGraphNodeList(G, 3);
deba@228
    44
  checkGraphEdgeList(G, 0);
deba@228
    45
deba@228
    46
  Edge e1 = G.addEdge(n1, n2);
deba@228
    47
  check((G.u(e1) == n1 && G.v(e1) == n2) || (G.u(e1) == n2 && G.v(e1) == n1),
deba@228
    48
        "Wrong edge");
deba@228
    49
  checkGraphNodeList(G, 3);
deba@228
    50
  checkGraphArcList(G, 2);
deba@228
    51
  checkGraphEdgeList(G, 1);
deba@228
    52
deba@228
    53
  checkGraphOutArcList(G, n1, 1);
deba@228
    54
  checkGraphOutArcList(G, n2, 1);
deba@228
    55
  checkGraphOutArcList(G, n3, 0);
deba@228
    56
deba@228
    57
  checkGraphInArcList(G, n1, 1);
deba@228
    58
  checkGraphInArcList(G, n2, 1);
deba@228
    59
  checkGraphInArcList(G, n3, 0);
deba@228
    60
deba@228
    61
  checkGraphIncEdgeList(G, n1, 1);
deba@228
    62
  checkGraphIncEdgeList(G, n2, 1);
deba@228
    63
  checkGraphIncEdgeList(G, n3, 0);
deba@228
    64
deba@228
    65
  checkGraphConArcList(G, 2);
deba@228
    66
  checkGraphConEdgeList(G, 1);
deba@228
    67
deba@228
    68
  Edge e2 = G.addEdge(n2, n1), e3 = G.addEdge(n2, n3);
deba@228
    69
  checkGraphNodeList(G, 3);
deba@228
    70
  checkGraphArcList(G, 6);
deba@228
    71
  checkGraphEdgeList(G, 3);
deba@228
    72
deba@228
    73
  checkGraphOutArcList(G, n1, 2);
deba@228
    74
  checkGraphOutArcList(G, n2, 3);
deba@228
    75
  checkGraphOutArcList(G, n3, 1);
deba@228
    76
deba@228
    77
  checkGraphInArcList(G, n1, 2);
deba@228
    78
  checkGraphInArcList(G, n2, 3);
deba@228
    79
  checkGraphInArcList(G, n3, 1);
deba@228
    80
deba@228
    81
  checkGraphIncEdgeList(G, n1, 2);
deba@228
    82
  checkGraphIncEdgeList(G, n2, 3);
deba@228
    83
  checkGraphIncEdgeList(G, n3, 1);
deba@228
    84
deba@228
    85
  checkGraphConArcList(G, 6);
deba@228
    86
  checkGraphConEdgeList(G, 3);
deba@228
    87
deba@228
    88
  checkArcDirections(G);
deba@228
    89
deba@228
    90
  checkNodeIds(G);
deba@228
    91
  checkArcIds(G);
deba@228
    92
  checkEdgeIds(G);
deba@228
    93
  checkGraphNodeMap(G);
deba@228
    94
  checkGraphArcMap(G);
deba@228
    95
  checkGraphEdgeMap(G);
deba@228
    96
}
deba@228
    97
deba@228
    98
void checkConcepts() {
kpeter@171
    99
  { // Checking graph components
deba@57
   100
    checkConcept<BaseGraphComponent, BaseGraphComponent >();
deba@57
   101
alpar@209
   102
    checkConcept<IDableGraphComponent<>,
deba@57
   103
      IDableGraphComponent<> >();
deba@57
   104
alpar@209
   105
    checkConcept<IterableGraphComponent<>,
deba@57
   106
      IterableGraphComponent<> >();
deba@57
   107
alpar@209
   108
    checkConcept<MappableGraphComponent<>,
deba@57
   109
      MappableGraphComponent<> >();
deba@57
   110
  }
kpeter@171
   111
  { // Checking skeleton graph
kpeter@171
   112
    checkConcept<Graph, Graph>();
deba@57
   113
  }
kpeter@171
   114
  { // Checking ListGraph
kpeter@171
   115
    checkConcept<Graph, ListGraph>();
kpeter@171
   116
    checkConcept<AlterableGraphComponent<>, ListGraph>();
kpeter@171
   117
    checkConcept<ExtendableGraphComponent<>, ListGraph>();
kpeter@171
   118
    checkConcept<ClearableGraphComponent<>, ListGraph>();
kpeter@171
   119
    checkConcept<ErasableGraphComponent<>, ListGraph>();
kpeter@171
   120
  }
kpeter@171
   121
  { // Checking SmartGraph
kpeter@171
   122
    checkConcept<Graph, SmartGraph>();
kpeter@171
   123
    checkConcept<AlterableGraphComponent<>, SmartGraph>();
kpeter@171
   124
    checkConcept<ExtendableGraphComponent<>, SmartGraph>();
kpeter@171
   125
    checkConcept<ClearableGraphComponent<>, SmartGraph>();
kpeter@171
   126
  }
kpeter@171
   127
//  { // Checking FullGraph
kpeter@171
   128
//    checkConcept<Graph, FullGraph>();
deba@335
   129
//    checkGraphIterators<FullGraph>();
kpeter@171
   130
//  }
kpeter@334
   131
  { // Checking GridGraph
kpeter@334
   132
    checkConcept<Graph, GridGraph>();
kpeter@334
   133
  }
deba@57
   134
}
deba@57
   135
deba@57
   136
template <typename Graph>
deba@228
   137
void checkGraphValidity() {
deba@149
   138
  TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@57
   139
  Graph g;
deba@57
   140
deba@57
   141
  Node
deba@57
   142
    n1 = g.addNode(),
deba@57
   143
    n2 = g.addNode(),
deba@57
   144
    n3 = g.addNode();
deba@57
   145
deba@57
   146
  Edge
deba@57
   147
    e1 = g.addEdge(n1, n2),
deba@57
   148
    e2 = g.addEdge(n2, n3);
deba@57
   149
kpeter@171
   150
  check(g.valid(n1), "Wrong validity check");
kpeter@171
   151
  check(g.valid(e1), "Wrong validity check");
kpeter@171
   152
  check(g.valid(g.direct(e1, true)), "Wrong validity check");
kpeter@171
   153
kpeter@171
   154
  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
kpeter@171
   155
  check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
kpeter@171
   156
  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@57
   157
}
deba@57
   158
deba@149
   159
template <typename Graph>
deba@228
   160
void checkGraphValidityErase() {
deba@149
   161
  TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@149
   162
  Graph g;
deba@149
   163
deba@149
   164
  Node
deba@149
   165
    n1 = g.addNode(),
deba@149
   166
    n2 = g.addNode(),
deba@149
   167
    n3 = g.addNode();
deba@149
   168
deba@149
   169
  Edge
deba@149
   170
    e1 = g.addEdge(n1, n2),
deba@149
   171
    e2 = g.addEdge(n2, n3);
deba@149
   172
kpeter@171
   173
  check(g.valid(n1), "Wrong validity check");
kpeter@171
   174
  check(g.valid(e1), "Wrong validity check");
kpeter@171
   175
  check(g.valid(g.direct(e1, true)), "Wrong validity check");
deba@149
   176
deba@149
   177
  g.erase(n1);
deba@149
   178
kpeter@171
   179
  check(!g.valid(n1), "Wrong validity check");
kpeter@171
   180
  check(g.valid(n2), "Wrong validity check");
kpeter@171
   181
  check(g.valid(n3), "Wrong validity check");
kpeter@171
   182
  check(!g.valid(e1), "Wrong validity check");
kpeter@171
   183
  check(g.valid(e2), "Wrong validity check");
deba@149
   184
kpeter@171
   185
  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
kpeter@171
   186
  check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
kpeter@171
   187
  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@149
   188
}
deba@149
   189
deba@335
   190
void checkGridGraph(int width, int height) {
deba@335
   191
  typedef GridGraph Graph;
deba@335
   192
  GRAPH_TYPEDEFS(Graph);
deba@335
   193
  Graph G(width, height);
deba@57
   194
kpeter@336
   195
  check(G.width() == width, "Wrong column number");
kpeter@336
   196
  check(G.height() == height, "Wrong row number");
deba@335
   197
deba@335
   198
  for (int i = 0; i < width; ++i) {
deba@335
   199
    for (int j = 0; j < height; ++j) {
deba@335
   200
      check(G.col(G(i, j)) == i, "Wrong column");
deba@335
   201
      check(G.row(G(i, j)) == j, "Wrong row");
deba@335
   202
      check(G.pos(G(i, j)).x == i, "Wrong column");
deba@335
   203
      check(G.pos(G(i, j)).y == j, "Wrong row");
kpeter@334
   204
    }
kpeter@334
   205
  }
alpar@209
   206
deba@335
   207
  for (int j = 0; j < height; ++j) {
deba@335
   208
    for (int i = 0; i < width - 1; ++i) {
deba@335
   209
      check(G.source(G.right(G(i, j))) == G(i, j), "Wrong right");
deba@335
   210
      check(G.target(G.right(G(i, j))) == G(i + 1, j), "Wrong right");
kpeter@334
   211
    }
deba@335
   212
    check(G.right(G(width - 1, j)) == INVALID, "Wrong right");
kpeter@334
   213
  }
deba@57
   214
deba@335
   215
  for (int j = 0; j < height; ++j) {
deba@335
   216
    for (int i = 1; i < width; ++i) {
deba@335
   217
      check(G.source(G.left(G(i, j))) == G(i, j), "Wrong left");
deba@335
   218
      check(G.target(G.left(G(i, j))) == G(i - 1, j), "Wrong left");
kpeter@334
   219
    }
deba@335
   220
    check(G.left(G(0, j)) == INVALID, "Wrong left");
kpeter@334
   221
  }
deba@57
   222
deba@335
   223
  for (int i = 0; i < width; ++i) {
deba@335
   224
    for (int j = 0; j < height - 1; ++j) {
deba@335
   225
      check(G.source(G.up(G(i, j))) == G(i, j), "Wrong up");
deba@335
   226
      check(G.target(G.up(G(i, j))) == G(i, j + 1), "Wrong up");
kpeter@334
   227
    }
deba@335
   228
    check(G.up(G(i, height - 1)) == INVALID, "Wrong up");
kpeter@334
   229
  }
deba@57
   230
deba@335
   231
  for (int i = 0; i < width; ++i) {
deba@335
   232
    for (int j = 1; j < height; ++j) {
deba@335
   233
      check(G.source(G.down(G(i, j))) == G(i, j), "Wrong down");
deba@335
   234
      check(G.target(G.down(G(i, j))) == G(i, j - 1), "Wrong down");
kpeter@334
   235
    }
deba@335
   236
    check(G.down(G(i, 0)) == INVALID, "Wrong down");
kpeter@334
   237
  }
kpeter@334
   238
deba@335
   239
  checkGraphNodeList(G, width * height);
deba@335
   240
  checkGraphEdgeList(G, width * (height - 1) + (width - 1) * height);
deba@335
   241
  checkGraphArcList(G, 2 * (width * (height - 1) + (width - 1) * height));
kpeter@334
   242
deba@335
   243
  for (NodeIt n(G); n != INVALID; ++n) {
deba@335
   244
    int nb = 4;
deba@335
   245
    if (G.col(n) == 0) --nb;
deba@335
   246
    if (G.col(n) == width - 1) --nb;
deba@335
   247
    if (G.row(n) == 0) --nb;
deba@335
   248
    if (G.row(n) == height - 1) --nb;
kpeter@334
   249
deba@335
   250
    checkGraphOutArcList(G, n, nb);
deba@335
   251
    checkGraphInArcList(G, n, nb);
deba@335
   252
    checkGraphIncEdgeList(G, n, nb);
deba@335
   253
  }
kpeter@334
   254
deba@335
   255
  checkArcDirections(G);
kpeter@334
   256
deba@335
   257
  checkGraphConArcList(G, 2 * (width * (height - 1) + (width - 1) * height));
deba@335
   258
  checkGraphConEdgeList(G, width * (height - 1) + (width - 1) * height);
kpeter@334
   259
deba@335
   260
  checkNodeIds(G);
deba@335
   261
  checkArcIds(G);
deba@335
   262
  checkEdgeIds(G);
deba@335
   263
  checkGraphNodeMap(G);
deba@335
   264
  checkGraphArcMap(G);
deba@335
   265
  checkGraphEdgeMap(G);
kpeter@334
   266
kpeter@334
   267
}
deba@57
   268
deba@228
   269
void checkGraphs() {
kpeter@171
   270
  { // Checking ListGraph
kpeter@171
   271
    checkGraph<ListGraph>();
deba@228
   272
    checkGraphValidityErase<ListGraph>();
kpeter@171
   273
  }
kpeter@171
   274
  { // Checking SmartGraph
kpeter@171
   275
    checkGraph<SmartGraph>();
deba@228
   276
    checkGraphValidity<SmartGraph>();
kpeter@171
   277
  }
kpeter@171
   278
//   { // Checking FullGraph
kpeter@171
   279
//     FullGraph g(5);
kpeter@171
   280
//     checkGraphNodeList(g, 5);
kpeter@171
   281
//     checkGraphEdgeList(g, 10);
kpeter@171
   282
//   }
kpeter@334
   283
  { // Checking GridGraph
deba@335
   284
    checkGridGraph(5, 8);
deba@335
   285
    checkGridGraph(8, 5);
deba@335
   286
    checkGridGraph(5, 5);
deba@335
   287
    checkGridGraph(0, 0);
deba@335
   288
    checkGridGraph(1, 1);
kpeter@334
   289
  }
kpeter@171
   290
}
kpeter@171
   291
deba@57
   292
int main() {
deba@228
   293
  checkConcepts();
deba@228
   294
  checkGraphs();
deba@57
   295
  return 0;
deba@57
   296
}