test/graph_test.cc
author deba
Wed, 28 Jun 2006 15:28:38 +0000
changeset 2112 f27dfd29c5c0
parent 1956 a055123339d5
child 2121 09a07a851506
permissions -rw-r--r--
Make explicit constructors
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2006
     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 <iostream>
    20 #include <vector>
    21 
    22 #include <lemon/concept/graph.h>
    23 #include <lemon/list_graph.h>
    24 #include <lemon/smart_graph.h>
    25 #include <lemon/full_graph.h>
    26 #include <lemon/hypercube_graph.h>
    27 
    28 #include "test_tools.h"
    29 #include "graph_test.h"
    30 #include "map_test.h"
    31 
    32 
    33 using namespace lemon;
    34 using namespace lemon::concept;
    35 
    36 
    37 int main() {
    38   { // checking graph components
    39     checkConcept<BaseGraphComponent, BaseGraphComponent >();
    40 
    41     checkConcept<BaseIterableGraphComponent, BaseIterableGraphComponent >();
    42 
    43     checkConcept<IDableGraphComponent, IDableGraphComponent >();
    44     checkConcept<MaxIDableGraphComponent, MaxIDableGraphComponent >();
    45 
    46     checkConcept<IterableGraphComponent, IterableGraphComponent >();
    47 
    48     checkConcept<MappableGraphComponent, MappableGraphComponent >();
    49 
    50   }
    51   { // checking skeleton graphs
    52     checkConcept<Graph, Graph >();
    53   }
    54   { // checking list graph
    55     checkConcept<Graph, ListGraph >();
    56 
    57     checkGraph<ListGraph>();
    58     checkGraphNodeMap<ListGraph>();
    59     checkGraphEdgeMap<ListGraph>();
    60   }
    61   { // checking smart graph
    62     checkConcept<Graph, SmartGraph >();
    63 
    64     checkGraph<SmartGraph>();
    65     checkGraphNodeMap<SmartGraph>();
    66     checkGraphEdgeMap<SmartGraph>();
    67   }
    68   { // checking full graph
    69     checkConcept<Graph, FullGraph >();
    70   }
    71   { // checking full graph
    72     checkConcept<Graph, HyperCubeGraph >();
    73   }
    74 
    75   std::cout << __FILE__ ": All tests passed.\n";
    76 
    77   return 0;
    78 }