test/ugraph_test.cc
author kpeter
Thu, 13 Nov 2008 15:29:04 +0000
changeset 2629 84354c78b068
parent 2391 14a343be7a5a
permissions -rw-r--r--
Improved constructors for min cost flow classes
Removing the non-zero lower bounds is faster
alpar@1956
     1
/* -*- C++ -*-
alpar@1956
     2
 *
alpar@1956
     3
 * This file is a part of LEMON, a generic C++ optimization library
alpar@1956
     4
 *
alpar@2553
     5
 * Copyright (C) 2003-2008
alpar@1956
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@1956
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@1956
     8
 *
alpar@1956
     9
 * Permission to use, modify and distribute this software is granted
alpar@1956
    10
 * provided that this copyright notice appears in all copies. For
alpar@1956
    11
 * precise terms see the accompanying LICENSE file.
alpar@1956
    12
 *
alpar@1956
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@1956
    14
 * express or implied, and with no claim as to its suitability for any
alpar@1956
    15
 * purpose.
alpar@1956
    16
 *
alpar@1956
    17
 */
klao@962
    18
klao@1795
    19
#include <lemon/bits/graph_extender.h>
alpar@2260
    20
#include <lemon/concepts/ugraph.h>
deba@2116
    21
#include <lemon/list_graph.h>
deba@2116
    22
#include <lemon/smart_graph.h>
deba@2116
    23
#include <lemon/full_graph.h>
deba@1979
    24
#include <lemon/grid_ugraph.h>
klao@962
    25
klao@1053
    26
#include <lemon/graph_utils.h>
klao@1053
    27
klao@962
    28
#include "test_tools.h"
klao@962
    29
klao@962
    30
klao@962
    31
using namespace lemon;
alpar@2260
    32
using namespace lemon::concepts;
klao@962
    33
klao@1053
    34
void check_concepts() {
klao@1034
    35
deba@2121
    36
  { // checking graph components
deba@2121
    37
    checkConcept<BaseUGraphComponent, BaseUGraphComponent >();
klao@1034
    38
deba@2121
    39
    checkConcept<IDableUGraphComponent<>, 
deba@2121
    40
      IDableUGraphComponent<> >();
deba@1680
    41
deba@2121
    42
    checkConcept<IterableUGraphComponent<>, 
deba@2121
    43
      IterableUGraphComponent<> >();
deba@2121
    44
deba@2121
    45
    checkConcept<MappableUGraphComponent<>, 
deba@2121
    46
      MappableUGraphComponent<> >();
deba@2121
    47
deba@2121
    48
  }
deba@2121
    49
  {
deba@2121
    50
    checkConcept<UGraph, ListUGraph>();
deba@2121
    51
    
deba@2121
    52
    checkConcept<UGraph, SmartUGraph>();
deba@2121
    53
    
deba@2121
    54
    checkConcept<UGraph, FullUGraph>();
deba@2121
    55
    
deba@2121
    56
    checkConcept<UGraph, UGraph>();
deba@2121
    57
    
deba@2121
    58
    checkConcept<UGraph, GridUGraph>();
deba@2121
    59
  }
klao@1053
    60
}
klao@1053
    61
klao@1054
    62
template <typename Graph>
klao@1053
    63
void check_item_counts(Graph &g, int n, int e) {
deba@1680
    64
  int nn = 0;
deba@1680
    65
  for (typename Graph::NodeIt it(g); it != INVALID; ++it) {
deba@1680
    66
    ++nn;
deba@1680
    67
  }
deba@1680
    68
deba@1680
    69
  check(nn == n, "Wrong node number.");
deba@1680
    70
  check(countNodes(g) == n, "Wrong node number.");
deba@1680
    71
deba@1680
    72
  int ee = 0;
deba@1680
    73
  for (typename Graph::EdgeIt it(g); it != INVALID; ++it) {
deba@1680
    74
    ++ee;
deba@1680
    75
  }
deba@1680
    76
deba@1680
    77
  check(ee == 2*e, "Wrong edge number.");
deba@1680
    78
  check(countEdges(g) == 2*e, "Wrong edge number.");
deba@1680
    79
deba@1680
    80
  int uee = 0;
klao@1909
    81
  for (typename Graph::UEdgeIt it(g); it != INVALID; ++it) {
deba@1680
    82
    ++uee;
deba@1680
    83
  }
deba@1680
    84
klao@1909
    85
  check(uee == e, "Wrong uedge number.");
klao@1909
    86
  check(countUEdges(g) == e, "Wrong uedge number.");
klao@1053
    87
}
klao@1053
    88
klao@1054
    89
template <typename Graph>
klao@1053
    90
void print_items(Graph &g) {
klao@1054
    91
klao@1054
    92
  typedef typename Graph::NodeIt NodeIt;
klao@1909
    93
  typedef typename Graph::UEdgeIt UEdgeIt;
klao@1054
    94
  typedef typename Graph::EdgeIt EdgeIt;
klao@1054
    95
alpar@1367
    96
  std::cout << "Nodes" << std::endl;
klao@1053
    97
  int i=0;
klao@1053
    98
  for(NodeIt it(g); it!=INVALID; ++it, ++i) {
alpar@1367
    99
    std::cout << "  " << i << ": " << g.id(it) << std::endl;
klao@1053
   100
  }
klao@1053
   101
klao@1909
   102
  std::cout << "UEdge" << std::endl;
klao@1053
   103
  i=0;
klao@1053
   104
  for(UEdgeIt it(g); it!=INVALID; ++it, ++i) {
alpar@1367
   105
    std::cout << "  " << i << ": " << g.id(it) 
klao@1053
   106
	 << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it)) 
alpar@1367
   107
	 << ")" << std::endl;
klao@1053
   108
  }
klao@1053
   109
alpar@1367
   110
  std::cout << "Edge" << std::endl;
klao@1053
   111
  i=0;
klao@1053
   112
  for(EdgeIt it(g); it!=INVALID; ++it, ++i) {
alpar@1367
   113
    std::cout << "  " << i << ": " << g.id(it)
klao@1053
   114
	 << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it)) 
alpar@1367
   115
	 << ")" << std::endl;
klao@1053
   116
  }
klao@1053
   117
klao@1053
   118
}
klao@1053
   119
klao@1054
   120
template <typename Graph>
klao@1054
   121
void check_graph() {
klao@1053
   122
klao@1054
   123
  typedef typename Graph::Node Node;
klao@1909
   124
  typedef typename Graph::UEdge UEdge;
klao@1054
   125
  typedef typename Graph::Edge Edge;
klao@1054
   126
  typedef typename Graph::NodeIt NodeIt;
klao@1909
   127
  typedef typename Graph::UEdgeIt UEdgeIt;
klao@1054
   128
  typedef typename Graph::EdgeIt EdgeIt;
klao@1053
   129
klao@1053
   130
  Graph g;
klao@1053
   131
klao@1053
   132
  check_item_counts(g,0,0);
klao@1053
   133
klao@1053
   134
  Node
klao@1053
   135
    n1 = g.addNode(),
klao@1053
   136
    n2 = g.addNode(),
klao@1053
   137
    n3 = g.addNode();
klao@1053
   138
klao@1053
   139
  UEdge
klao@1053
   140
    e1 = g.addEdge(n1, n2),
klao@1053
   141
    e2 = g.addEdge(n2, n3);
klao@1053
   142
klao@1053
   143
  // print_items(g);
klao@1053
   144
klao@1053
   145
  check_item_counts(g,3,2);
deba@1680
   146
}
klao@1030
   147
deba@1979
   148
void checkGridUGraph(const GridUGraph& g, int w, int h) {
deba@1680
   149
  check(g.width() == w, "Wrong width");
deba@1680
   150
  check(g.height() == h, "Wrong height");
klao@1054
   151
deba@1680
   152
  for (int i = 0; i < w; ++i) {
deba@1680
   153
    for (int j = 0; j < h; ++j) {
deba@1680
   154
      check(g.col(g(i, j)) == i, "Wrong col");
deba@1680
   155
      check(g.row(g(i, j)) == j, "Wrong row");
deba@1680
   156
    }
deba@1680
   157
  }
deba@1680
   158
  
deba@1680
   159
  for (int i = 0; i < w; ++i) {
deba@1680
   160
    for (int j = 0; j < h - 1; ++j) {
deba@1680
   161
      check(g.source(g.down(g(i, j))) == g(i, j), "Wrong down");
deba@1680
   162
      check(g.target(g.down(g(i, j))) == g(i, j + 1), "Wrong down");
deba@1680
   163
    }
deba@1680
   164
    check(g.down(g(i, h - 1)) == INVALID, "Wrong down");
deba@1680
   165
  }
deba@1680
   166
deba@1680
   167
  for (int i = 0; i < w; ++i) {
deba@1680
   168
    for (int j = 1; j < h; ++j) {
deba@1680
   169
      check(g.source(g.up(g(i, j))) == g(i, j), "Wrong up");
deba@1680
   170
      check(g.target(g.up(g(i, j))) == g(i, j - 1), "Wrong up");
deba@1680
   171
    }
deba@1680
   172
    check(g.up(g(i, 0)) == INVALID, "Wrong up");
deba@1680
   173
  }
deba@1680
   174
deba@1680
   175
  for (int j = 0; j < h; ++j) {
deba@1680
   176
    for (int i = 0; i < w - 1; ++i) {
deba@1680
   177
      check(g.source(g.right(g(i, j))) == g(i, j), "Wrong right");
deba@1680
   178
      check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");      
deba@1680
   179
    }
deba@1680
   180
    check(g.right(g(w - 1, j)) == INVALID, "Wrong right");    
deba@1680
   181
  }
deba@1680
   182
deba@1680
   183
  for (int j = 0; j < h; ++j) {
deba@1680
   184
    for (int i = 1; i < w; ++i) {
deba@1680
   185
      check(g.source(g.left(g(i, j))) == g(i, j), "Wrong left");
deba@1680
   186
      check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");      
deba@1680
   187
    }
deba@1680
   188
    check(g.left(g(0, j)) == INVALID, "Wrong left");    
deba@1680
   189
  }
klao@1054
   190
}
klao@1054
   191
klao@1054
   192
int main() {
klao@1054
   193
  check_concepts();
klao@1054
   194
klao@1909
   195
  check_graph<ListUGraph>();
klao@1909
   196
  check_graph<SmartUGraph>();
klao@1054
   197
deba@1568
   198
  {
klao@1909
   199
    FullUGraph g(5);
deba@1568
   200
    check_item_counts(g, 5, 10);
deba@1568
   201
  }
deba@1568
   202
deba@1680
   203
  {
deba@1979
   204
    GridUGraph g(5, 6);
deba@1680
   205
    check_item_counts(g, 30, 49);
deba@1979
   206
    checkGridUGraph(g, 5, 6);
deba@1680
   207
  }
deba@1680
   208
deba@1680
   209
  std::cout << __FILE__ ": All tests passed.\n";
deba@1680
   210
klao@962
   211
  return 0;
klao@962
   212
}