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

Timestamp:

03/02/07 19:04:28 (17 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:

• test/bipartite_matching_test.cc (modified) (5 diffs)

test/bipartite_matching_test.cc

@@ -20 +20 @@
 BPUGRAPH_TYPEDEFS(Graph);
 
-const int n = 10;
-const int m = 10;
-const int e = 52;
-const int c = 100;
-
-const int sa[e] = { 6, 5, 6, 4, 1, 0, 9, 5, 2, 4, 4, 3, 5,
+const int N = 10;
+const int M = 10;
+const int E = 52;
+const int C = 100;
+
+const int sa[E] = { 6, 5, 6, 4, 1, 0, 9, 5, 2, 4, 4, 3, 5,
                     2, 3, 8, 3, 4, 9, 6, 9, 4, 3, 1, 5, 8,
                     4, 8, 9, 2, 2, 3, 0, 5, 2, 3, 6, 3, 8,
                     8, 4, 0, 9, 9, 6, 2, 1, 2, 7, 1, 9, 4};
 
-const int ta[e] = { 2, 7, 4, 8, 6, 3, 4, 1, 7, 7, 0, 1, 6,
+const int ta[E] = { 2, 7, 4, 8, 6, 3, 4, 1, 7, 7, 0, 1, 6,
                     3, 2, 6, 8, 3, 5, 6, 3, 1, 8, 7, 2, 0,
                     6, 9, 6, 7, 8, 3, 3, 4, 5, 8, 6, 4, 1,
                     4, 3, 3, 8, 7, 7, 3, 7, 7, 3, 5, 1, 6};
 
-const int wa[e] = { 3, 99, 85, 16, 79, 52, 83, 99, 62, 6, 42, 6, 95,
+const int wa[E] = { 3, 99, 85, 16, 79, 52, 83, 99, 62, 6, 42, 6, 95,
                     13, 34, 9, 5, 38, 39, 75, 99, 12, 73, 35, 93, 43,
                     54, 91, 45, 26, 77, 47, 11, 22, 50, 74, 37, 64, 91,
@@ -53 +53 @@
   int min_cost_matching;
 
-  for (int i = 0; i < n; ++i) {
+  for (int i = 0; i < N; ++i) {
     Node node = graph.addANode();
     aNodes.push_back(node);
   }
-  for (int i = 0; i < m; ++i) {
+  for (int i = 0; i < M; ++i) {
     Node node = graph.addBNode();
     bNodes.push_back(node);
   }
-  for (int i = 0; i < e; ++i) {
+  for (int i = 0; i < E; ++i) {
     Node aNode = aNodes[sa[i]];
     Node bNode = bNodes[ta[i]];
@@ -289 +289 @@
 
   Graph::UEdgeMap<int> cost(graph);
-  cost = subMap(constMap<UEdge>(c), weight);
+  cost = subMap(constMap<UEdge>(C), weight);
   {
 
@@ -304 +304 @@
     min_cost_matching = bpmatch.matchingCost();
     check(max_cardinality == bpmatch.matchingSize(), "WRONG SIZE");
-    check(max_cardinality * c - max_cardinality_max_weight 
+    check(max_cardinality * C - max_cardinality_max_weight 
           == bpmatch.matchingCost(), "WRONG SIZE");
 
@@ -327 +327 @@
     min_cost_matching = bpmatch.matchingCost();
     check(max_cardinality == bpmatch.matchingSize(), "WRONG SIZE");
-    check(max_cardinality * c - max_cardinality_max_weight 
+    check(max_cardinality * C - max_cardinality_max_weight 
           == bpmatch.matchingCost(), "WRONG SIZE");