Changeset 210:81cfc04531e8 in lemon for test/graph_utils_test.cc

Timestamp:

07/13/08 21:09:47 (16 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

211:542dd614cbb4, 212:1ae84dea7d09, 214:60eecd3fe37a, 216:6d7bfcf5b48e

Phase:

public

Message:

Remove long lines (from all but one file)

File:

• test/graph_utils_test.cc (modified) (2 diffs)

test/graph_utils_test.cc

@@ -93 +93 @@
         Arc con3 = al3(src, trg);
         Arc con4 = findArc(fg, src, trg);
-        check(con1 == con2 && con2 == con3 && con3 == con4, "Different results.")
+        check(con1 == con2 && con2 == con3 && con3 == con4,
+              "Different results.")
         check(con1 != INVALID, "There is no connecting arc.");
         check(fg.source(con1) == src, "Wrong source.");
         check(fg.target(con1) == trg, "Wrong target.");
-        check(al3(src, trg, con3) == INVALID, "There is more connecting arc.");
-        check(findArc(fg, src, trg, con4) == INVALID, "There is more connecting arc.");
+        check(al3(src, trg, con3) == INVALID,
+              "There is more connecting arc.");
+        check(findArc(fg, src, trg, con4) == INVALID,
+              "There is more connecting arc.");
       }
     }
@@ -124 +127 @@
       for (ConEdgeIt<Graph> con(graph, src, trg); con != INVALID; ++con) {
         check( (graph.u(con) == src && graph.v(con) == trg) ||
-               (graph.v(con) == src && graph.u(con) == trg), "Wrong end nodes.");
+               (graph.v(con) == src && graph.u(con) == trg),
+               "Wrong end nodes.");
         ++found[con];
         check(found[con] <= 2, "The edge found more than twice.");