test/ugraph_test.cc
changeset 2198 416b0c06b5c8
parent 2116 b6a68c15a6a3
child 2231 06faf3f06d67
equal deleted inserted replaced
5:150a52f3fd13 6:623841861ea4
    30 
    30 
    31 using namespace lemon;
    31 using namespace lemon;
    32 using namespace lemon::concept;
    32 using namespace lemon::concept;
    33 
    33 
    34 void check_concepts() {
    34 void check_concepts() {
    35   checkConcept<UGraph, ListUGraph>();
    35 
    36 
    36   { // checking graph components
    37   checkConcept<UGraph, SmartUGraph>();
    37     checkConcept<BaseUGraphComponent, BaseUGraphComponent >();
    38 
    38 
    39   checkConcept<UGraph, FullUGraph>();
    39     checkConcept<BaseIterableUGraphComponent<>, 
    40 
    40       BaseIterableUGraphComponent<> >();
    41   checkConcept<UGraph, UGraph>();
    41 
    42 
    42     checkConcept<IDableUGraphComponent<>, 
    43   checkConcept<UGraph, GridUGraph>();
    43       IDableUGraphComponent<> >();
       
    44 
       
    45     checkConcept<IterableUGraphComponent<>, 
       
    46       IterableUGraphComponent<> >();
       
    47 
       
    48     checkConcept<MappableUGraphComponent<>, 
       
    49       MappableUGraphComponent<> >();
       
    50 
       
    51   }
       
    52   {
       
    53     checkConcept<UGraph, ListUGraph>();
       
    54     
       
    55     checkConcept<UGraph, SmartUGraph>();
       
    56     
       
    57     checkConcept<UGraph, FullUGraph>();
       
    58     
       
    59     checkConcept<UGraph, UGraph>();
       
    60     
       
    61     checkConcept<UGraph, GridUGraph>();
       
    62   }
    44 }
    63 }
    45 
    64 
    46 template <typename Graph>
    65 template <typename Graph>
    47 void check_item_counts(Graph &g, int n, int e) {
    66 void check_item_counts(Graph &g, int n, int e) {
    48   int nn = 0;
    67   int nn = 0;