test/path_test.cc
author kpeter
Tue, 05 Feb 2008 11:23:23 +0000
changeset 2562 27c54b7f4f1d
parent 2391 14a343be7a5a
permissions -rw-r--r--
Improvements and fixes in dim2.h.

- Several doc improvements.
- Fix BoundingBox::operator& implementation.
alpar@906
     1
/* -*- C++ -*-
alpar@906
     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@1359
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@906
     8
 *
alpar@906
     9
 * Permission to use, modify and distribute this software is granted
alpar@906
    10
 * provided that this copyright notice appears in all copies. For
alpar@906
    11
 * precise terms see the accompanying LICENSE file.
alpar@906
    12
 *
alpar@906
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@906
    14
 * express or implied, and with no claim as to its suitability for any
alpar@906
    15
 * purpose.
alpar@906
    16
 *
alpar@906
    17
 */
alpar@906
    18
hegyi@820
    19
#include <string>
hegyi@820
    20
#include <iostream>
deba@2247
    21
alpar@2260
    22
#include <lemon/concepts/path.h>
alpar@2260
    23
#include <lemon/concepts/graph.h>
deba@2247
    24
alpar@921
    25
#include <lemon/path.h>
alpar@921
    26
#include <lemon/list_graph.h>
hegyi@820
    27
deba@2247
    28
#include "test_tools.h"
deba@2247
    29
hegyi@820
    30
using namespace std;
alpar@921
    31
using namespace lemon;
hegyi@820
    32
deba@2247
    33
void check_concepts() {
deba@2335
    34
  checkConcept<concepts::Path<ListGraph>, concepts::Path<ListGraph> >();
alpar@2260
    35
  checkConcept<concepts::Path<ListGraph>, Path<ListGraph> >();
deba@2335
    36
  checkConcept<concepts::Path<ListGraph>, SimplePath<ListGraph> >();
deba@2335
    37
  checkConcept<concepts::Path<ListGraph>, StaticPath<ListGraph> >();
deba@2335
    38
  checkConcept<concepts::Path<ListGraph>, ListPath<ListGraph> >();
hegyi@820
    39
}
hegyi@820
    40
deba@2247
    41
int main() {
deba@2335
    42
  check_concepts();  
deba@2247
    43
  return 0;
hegyi@820
    44
}