Changeset 209:765619b7cbb2 in lemon-1.2 for test/graph_maps_test.h

Timestamp:

07/13/08 20:51:02 (16 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Phase:

public

Message:

Apply unify-sources.sh to the source tree

File:

• test/graph_maps_test.h (modified) (5 diffs)

test/graph_maps_test.h

@@ -1 @@
-/* -*- C++ -*-
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
  *
- * This file is a part of LEMON, a generic C++ optimization library
+ * This file is a part of LEMON, a generic C++ optimization library.
  *
  * Copyright (C) 2003-2008
@@ -72 +72 @@
     for (int i = 0; i < num; ++i) {
       for (int j = 0; j < i; ++j) {
-        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
+        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
       }
     }
@@ -85 +85 @@
     for (int i = 0; i < num; ++i) {
       for (int j = i + 1; j < num; ++j) {
-        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
-        map[arcs.back()] = 23;
+        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
+        map[arcs.back()] = 23;
         check(map[arcs.back()] == 23, "Wrong operator[].");
       }
@@ -114 +114 @@
     for (int i = 0; i < num; ++i) {
       for (int j = 0; j < i; ++j) {
-        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
+        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
       }
     }
@@ -127 +127 @@
     for (int i = 0; i < num; ++i) {
       for (int j = i + 1; j < num; ++j) {
-        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
-        map[edges.back()] = 23;
+        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
+        map[edges.back()] = 23;
         check(map[edges.back()] == 23, "Wrong operator[].");
       }