COIN-OR::LEMON - Graph Library

Changeset 2386:81b47fc5c444 in lemon-0.x for test/max_matching_test.cc


Ignore:
Timestamp:
03/02/07 19:04:28 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3217
Message:

Hard Warning checking

  • based on the remark of the ZIB user
  • we do not use -Winline
File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/max_matching_test.cc

    r2116 r2386  
    7575    if ( mate[v]!=INVALID ) ++s;
    7676  }
    77   int size=(int)s/2;  //size will be used as the size of a maxmatching
     77  int size=int(s/2);  //size will be used as the size of a maxmatching
    7878
    7979  for(NodeIt v(g); v!=INVALID; ++v) {
     
    9393    if ( mate[v]!=INVALID ) ++s;
    9494  }
    95   check ( (int)s/2 == size, "The size does not equal!" );
     95  check ( int(s/2) == size, "The size does not equal!" );
    9696
    9797  Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos1(g);
     
    104104    if ( mate[v]!=INVALID ) ++s;
    105105  }
    106   check ( (int)s/2 == size, "The size does not equal!" );
     106  check ( int(s/2) == size, "The size does not equal!" );
    107107 
    108108  Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos2(g);
     
    116116    if ( mate[v]!=INVALID ) ++s;
    117117  }
    118   check ( (int)s/2 == size, "The size does not equal!" );
     118  check ( int(s/2) == size, "The size does not equal!" );
    119119 
    120120  Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos(g);
     
    177177    if ( pos[v]==max_matching.A ) ++barrier;
    178178  }
    179   int expected_size=(int)( countNodes(g)-num_comp+barrier)/2;
     179  int expected_size=int( countNodes(g)-num_comp+barrier)/2;
    180180  check ( size==expected_size, "The size of the matching is wrong." );
    181181 
Note: See TracChangeset for help on using the changeset viewer.