lemon-0.x: comparison test/arborescence

equal deleted inserted replaced

-:3365c9f25fdd
+:7c8fe7296d03
 #include "test_tools.h"
 using namespace lemon;
 using namespace std;
-const int n = 10;
+const int NODES = 10;
-const int e = 22;
+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,
 1, 0
 };
-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,
 1, 3
 };
-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,
 45.7094, 34.6184, 100.156, 95.726, 22.3429,
 31.587, 51.6972, 29.6773, 115.038, 32.4137,
 60.0038, 40.1237
 Graph graph;
 CostMap cost(graph);
 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];
 }
 Node source = nodes[sourceNode];
 Tolerance<double> tolerance;
 for (EdgeIt it(graph); it != INVALID; ++it) {
 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() &&
 dualSolution[i].second.find(graph.source(it))
 == dualSolution[i].second.end()) {
 sum += dualSolution[i].first;