test/path_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
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2008
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 
    19 #include <string>
    20 #include <iostream>
    21 
    22 #include <lemon/concepts/path.h>
    23 #include <lemon/concepts/graph.h>
    24 
    25 #include <lemon/path.h>
    26 #include <lemon/list_graph.h>
    27 
    28 #include "test_tools.h"
    29 
    30 using namespace std;
    31 using namespace lemon;
    32 
    33 void check_concepts() {
    34   checkConcept<concepts::Path<ListGraph>, concepts::Path<ListGraph> >();
    35   checkConcept<concepts::Path<ListGraph>, Path<ListGraph> >();
    36   checkConcept<concepts::Path<ListGraph>, SimplePath<ListGraph> >();
    37   checkConcept<concepts::Path<ListGraph>, StaticPath<ListGraph> >();
    38   checkConcept<concepts::Path<ListGraph>, ListPath<ListGraph> >();
    39 }
    40 
    41 int main() {
    42   check_concepts();  
    43   return 0;
    44 }