test/graph_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 09 Oct 2008 22:41:29 +0200
changeset 318 1e2d6ca80793
parent 209 765619b7cbb2
child 346 ada5f74d1c9e
child 365 37557a46e298
child 387 49d9a36b3b84
permissions -rw-r--r--
Doc improvements
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>
deba@57
    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>();
kpeter@171
   129
//    checkGraphIterators<FullGraph>();
kpeter@171
   130
//  }
kpeter@171
   131
//  { // Checking GridGraph
kpeter@171
   132
//    checkConcept<Graph, GridGraph>();
kpeter@171
   133
//    checkGraphIterators<GridGraph>();
kpeter@171
   134
//  }
deba@57
   135
}
deba@57
   136
deba@57
   137
template <typename Graph>
deba@228
   138
void checkGraphValidity() {
deba@149
   139
  TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@57
   140
  Graph g;
deba@57
   141
deba@57
   142
  Node
deba@57
   143
    n1 = g.addNode(),
deba@57
   144
    n2 = g.addNode(),
deba@57
   145
    n3 = g.addNode();
deba@57
   146
deba@57
   147
  Edge
deba@57
   148
    e1 = g.addEdge(n1, n2),
deba@57
   149
    e2 = g.addEdge(n2, n3);
deba@57
   150
kpeter@171
   151
  check(g.valid(n1), "Wrong validity check");
kpeter@171
   152
  check(g.valid(e1), "Wrong validity check");
kpeter@171
   153
  check(g.valid(g.direct(e1, true)), "Wrong validity check");
kpeter@171
   154
kpeter@171
   155
  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
kpeter@171
   156
  check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
kpeter@171
   157
  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@57
   158
}
deba@57
   159
deba@149
   160
template <typename Graph>
deba@228
   161
void checkGraphValidityErase() {
deba@149
   162
  TEMPLATE_GRAPH_TYPEDEFS(Graph);
deba@149
   163
  Graph g;
deba@149
   164
deba@149
   165
  Node
deba@149
   166
    n1 = g.addNode(),
deba@149
   167
    n2 = g.addNode(),
deba@149
   168
    n3 = g.addNode();
deba@149
   169
deba@149
   170
  Edge
deba@149
   171
    e1 = g.addEdge(n1, n2),
deba@149
   172
    e2 = g.addEdge(n2, n3);
deba@149
   173
kpeter@171
   174
  check(g.valid(n1), "Wrong validity check");
kpeter@171
   175
  check(g.valid(e1), "Wrong validity check");
kpeter@171
   176
  check(g.valid(g.direct(e1, true)), "Wrong validity check");
deba@149
   177
deba@149
   178
  g.erase(n1);
deba@149
   179
kpeter@171
   180
  check(!g.valid(n1), "Wrong validity check");
kpeter@171
   181
  check(g.valid(n2), "Wrong validity check");
kpeter@171
   182
  check(g.valid(n3), "Wrong validity check");
kpeter@171
   183
  check(!g.valid(e1), "Wrong validity check");
kpeter@171
   184
  check(g.valid(e2), "Wrong validity check");
deba@149
   185
kpeter@171
   186
  check(!g.valid(g.nodeFromId(-1)), "Wrong validity check");
kpeter@171
   187
  check(!g.valid(g.edgeFromId(-1)), "Wrong validity check");
kpeter@171
   188
  check(!g.valid(g.arcFromId(-1)), "Wrong validity check");
deba@149
   189
}
deba@149
   190
deba@57
   191
// void checkGridGraph(const GridGraph& g, int w, int h) {
deba@57
   192
//   check(g.width() == w, "Wrong width");
deba@57
   193
//   check(g.height() == h, "Wrong height");
deba@57
   194
deba@57
   195
//   for (int i = 0; i < w; ++i) {
deba@57
   196
//     for (int j = 0; j < h; ++j) {
deba@57
   197
//       check(g.col(g(i, j)) == i, "Wrong col");
deba@57
   198
//       check(g.row(g(i, j)) == j, "Wrong row");
deba@57
   199
//     }
deba@57
   200
//   }
alpar@209
   201
deba@57
   202
//   for (int i = 0; i < w; ++i) {
deba@57
   203
//     for (int j = 0; j < h - 1; ++j) {
deba@57
   204
//       check(g.source(g.down(g(i, j))) == g(i, j), "Wrong down");
deba@57
   205
//       check(g.target(g.down(g(i, j))) == g(i, j + 1), "Wrong down");
deba@57
   206
//     }
deba@57
   207
//     check(g.down(g(i, h - 1)) == INVALID, "Wrong down");
deba@57
   208
//   }
deba@57
   209
deba@57
   210
//   for (int i = 0; i < w; ++i) {
deba@57
   211
//     for (int j = 1; j < h; ++j) {
deba@57
   212
//       check(g.source(g.up(g(i, j))) == g(i, j), "Wrong up");
deba@57
   213
//       check(g.target(g.up(g(i, j))) == g(i, j - 1), "Wrong up");
deba@57
   214
//     }
deba@57
   215
//     check(g.up(g(i, 0)) == INVALID, "Wrong up");
deba@57
   216
//   }
deba@57
   217
deba@57
   218
//   for (int j = 0; j < h; ++j) {
deba@57
   219
//     for (int i = 0; i < w - 1; ++i) {
deba@57
   220
//       check(g.source(g.right(g(i, j))) == g(i, j), "Wrong right");
alpar@209
   221
//       check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");
deba@57
   222
//     }
alpar@209
   223
//     check(g.right(g(w - 1, j)) == INVALID, "Wrong right");
deba@57
   224
//   }
deba@57
   225
deba@57
   226
//   for (int j = 0; j < h; ++j) {
deba@57
   227
//     for (int i = 1; i < w; ++i) {
deba@57
   228
//       check(g.source(g.left(g(i, j))) == g(i, j), "Wrong left");
alpar@209
   229
//       check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");
deba@57
   230
//     }
alpar@209
   231
//     check(g.left(g(0, j)) == INVALID, "Wrong left");
deba@57
   232
//   }
deba@57
   233
// }
deba@57
   234
deba@228
   235
void checkGraphs() {
kpeter@171
   236
  { // Checking ListGraph
kpeter@171
   237
    checkGraph<ListGraph>();
deba@228
   238
    checkGraphValidityErase<ListGraph>();
kpeter@171
   239
  }
kpeter@171
   240
  { // Checking SmartGraph
kpeter@171
   241
    checkGraph<SmartGraph>();
deba@228
   242
    checkGraphValidity<SmartGraph>();
kpeter@171
   243
  }
kpeter@171
   244
//   { // Checking FullGraph
kpeter@171
   245
//     FullGraph g(5);
kpeter@171
   246
//     checkGraphNodeList(g, 5);
kpeter@171
   247
//     checkGraphEdgeList(g, 10);
kpeter@171
   248
//   }
kpeter@171
   249
//   { // Checking GridGraph
kpeter@171
   250
//     GridGraph g(5, 6);
kpeter@171
   251
//     checkGraphNodeList(g, 30);
kpeter@171
   252
//     checkGraphEdgeList(g, 49);
kpeter@171
   253
//     checkGridGraph(g, 5, 6);
kpeter@171
   254
//   }
kpeter@171
   255
}
kpeter@171
   256
deba@57
   257
int main() {
deba@228
   258
  checkConcepts();
deba@228
   259
  checkGraphs();
deba@57
   260
  return 0;
deba@57
   261
}