Changeset 2386:81b47fc5c444 in lemon-0.x for test/arborescence_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/arborescence_test.cc (modified) (5 diffs)

test/arborescence_test.cc

@@ -20 +20 @@
 using namespace std;
 
-const int n = 10;
-const int e = 22;
+const int NODES = 10;
+const int EDGES = 22;
 
 int sourceNode = 0;
 
-int sources[e] = {
+int sources[EDGES] = {
   1, 0, 2, 4, 4, 3, 9, 8, 9, 8,
   4, 2, 0, 6, 4, 1, 7, 2, 8, 6,
@@ -31 +31 @@
 };
 
-int targets[e] = {
+int targets[EDGES] = {
   8, 3, 1, 1, 4, 9, 8, 1, 8, 0,
   3, 2, 1, 3, 1, 1, 2, 6, 3, 9,
@@ -37 +37 @@
 };
 
-double costs[e] = {
+double costs[EDGES] = {
   107.444, 70.3069, 46.0496, 28.3962, 91.4325,
   76.9443, 61.986, 39.3754, 74.9575, 39.3153,
@@ -57 +57 @@
   vector<Node> nodes;
   
-  for (int i = 0; i < n; ++i) {
+  for (int i = 0; i < NODES; ++i) {
     nodes.push_back(graph.addNode());
   }
 
-  for (int i = 0; i < e; ++i) {
+  for (int i = 0; i < EDGES; ++i) {
     Edge edge = graph.addEdge(nodes[sources[i]], nodes[targets[i]]);
     cost[edge] = costs[i];
@@ -86 +86 @@
     if (mca.reached(graph.source(it))) {
       double sum = 0.0;
-      for (int i = 0; i < (int)dualSolution.size(); ++i) {
+      for (int i = 0; i < int(dualSolution.size()); ++i) {
         if (dualSolution[i].second.find(graph.target(it)) 
             != dualSolution[i].second.end() &&