COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/02/07 19:04:28 (12 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/bipartite_matching_test.cc

    r2137 r2386  
    2020BPUGRAPH_TYPEDEFS(Graph);
    2121
    22 const int n = 10;
    23 const int m = 10;
    24 const int e = 52;
    25 const int c = 100;
    26 
    27 const int sa[e] = { 6, 5, 6, 4, 1, 0, 9, 5, 2, 4, 4, 3, 5,
     22const int N = 10;
     23const int M = 10;
     24const int E = 52;
     25const int C = 100;
     26
     27const int sa[E] = { 6, 5, 6, 4, 1, 0, 9, 5, 2, 4, 4, 3, 5,
    2828                    2, 3, 8, 3, 4, 9, 6, 9, 4, 3, 1, 5, 8,
    2929                    4, 8, 9, 2, 2, 3, 0, 5, 2, 3, 6, 3, 8,
    3030                    8, 4, 0, 9, 9, 6, 2, 1, 2, 7, 1, 9, 4};
    3131
    32 const int ta[e] = { 2, 7, 4, 8, 6, 3, 4, 1, 7, 7, 0, 1, 6,
     32const int ta[E] = { 2, 7, 4, 8, 6, 3, 4, 1, 7, 7, 0, 1, 6,
    3333                    3, 2, 6, 8, 3, 5, 6, 3, 1, 8, 7, 2, 0,
    3434                    6, 9, 6, 7, 8, 3, 3, 4, 5, 8, 6, 4, 1,
    3535                    4, 3, 3, 8, 7, 7, 3, 7, 7, 3, 5, 1, 6};
    3636
    37 const int wa[e] = { 3, 99, 85, 16, 79, 52, 83, 99, 62, 6, 42, 6, 95,
     37const int wa[E] = { 3, 99, 85, 16, 79, 52, 83, 99, 62, 6, 42, 6, 95,
    3838                    13, 34, 9, 5, 38, 39, 75, 99, 12, 73, 35, 93, 43,
    3939                    54, 91, 45, 26, 77, 47, 11, 22, 50, 74, 37, 64, 91,
     
    5353  int min_cost_matching;
    5454
    55   for (int i = 0; i < n; ++i) {
     55  for (int i = 0; i < N; ++i) {
    5656    Node node = graph.addANode();
    5757    aNodes.push_back(node);
    5858  }
    59   for (int i = 0; i < m; ++i) {
     59  for (int i = 0; i < M; ++i) {
    6060    Node node = graph.addBNode();
    6161    bNodes.push_back(node);
    6262  }
    63   for (int i = 0; i < e; ++i) {
     63  for (int i = 0; i < E; ++i) {
    6464    Node aNode = aNodes[sa[i]];
    6565    Node bNode = bNodes[ta[i]];
     
    289289
    290290  Graph::UEdgeMap<int> cost(graph);
    291   cost = subMap(constMap<UEdge>(c), weight);
     291  cost = subMap(constMap<UEdge>(C), weight);
    292292  {
    293293
     
    304304    min_cost_matching = bpmatch.matchingCost();
    305305    check(max_cardinality == bpmatch.matchingSize(), "WRONG SIZE");
    306     check(max_cardinality * c - max_cardinality_max_weight
     306    check(max_cardinality * C - max_cardinality_max_weight
    307307          == bpmatch.matchingCost(), "WRONG SIZE");
    308308
     
    327327    min_cost_matching = bpmatch.matchingCost();
    328328    check(max_cardinality == bpmatch.matchingSize(), "WRONG SIZE");
    329     check(max_cardinality * c - max_cardinality_max_weight
     329    check(max_cardinality * C - max_cardinality_max_weight
    330330          == bpmatch.matchingCost(), "WRONG SIZE");
    331331
Note: See TracChangeset for help on using the changeset viewer.