src/test/graph_utils_test.cc
author alpar
Fri, 08 Apr 2005 06:34:34 +0000
changeset 1322 cfc26d103bcf
parent 946 c94ef40a22ce
permissions -rw-r--r--
Demo prog that computes the max flow by LP
klao@946
     1
// -*- c++ -*-
klao@946
     2
klao@946
     3
#include <iostream>
klao@946
     4
#include <vector>
klao@946
     5
klao@977
     6
#include <lemon/graph_utils.h>
klao@977
     7
klao@946
     8
#include <lemon/list_graph.h>
klao@946
     9
#include <lemon/smart_graph.h>
klao@946
    10
#include <lemon/full_graph.h>
klao@946
    11
klao@946
    12
#include "test_tools.h"
klao@946
    13
#include "graph_utils_test.h"
klao@946
    14
klao@946
    15
klao@946
    16
using namespace lemon;
klao@946
    17
klao@946
    18
klao@946
    19
int main() {
klao@946
    20
  ///\file
klao@946
    21
  { // checking list graph
klao@946
    22
    checkGraphCounters<ListGraph>();
klao@946
    23
  }
klao@946
    24
  { // checking smart graph
klao@946
    25
    checkGraphCounters<SmartGraph>();
klao@946
    26
  }
klao@977
    27
  {
klao@977
    28
    int num = 5;
klao@977
    29
    FullGraph fg(num);
klao@977
    30
    check(countNodes(fg) == num, "FullGraph: wrong node number.");
klao@977
    31
    check(countEdges(fg) == num*num, "FullGraph: wrong edge number.");    
klao@977
    32
  }
klao@946
    33
klao@946
    34
  std::cout << __FILE__ ": All tests passed.\n";
klao@946
    35
klao@946
    36
  return 0;
klao@946
    37
}