1.1 --- a/test/graph_utils_test.cc Sun Jul 13 19:51:02 2008 +0100
1.2 +++ b/test/graph_utils_test.cc Sun Jul 13 20:09:47 2008 +0100
1.3 @@ -92,12 +92,15 @@
1.4 Arc con2 = al2(src, trg);
1.5 Arc con3 = al3(src, trg);
1.6 Arc con4 = findArc(fg, src, trg);
1.7 - check(con1 == con2 && con2 == con3 && con3 == con4, "Different results.")
1.8 + check(con1 == con2 && con2 == con3 && con3 == con4,
1.9 + "Different results.")
1.10 check(con1 != INVALID, "There is no connecting arc.");
1.11 check(fg.source(con1) == src, "Wrong source.");
1.12 check(fg.target(con1) == trg, "Wrong target.");
1.13 - check(al3(src, trg, con3) == INVALID, "There is more connecting arc.");
1.14 - check(findArc(fg, src, trg, con4) == INVALID, "There is more connecting arc.");
1.15 + check(al3(src, trg, con3) == INVALID,
1.16 + "There is more connecting arc.");
1.17 + check(findArc(fg, src, trg, con4) == INVALID,
1.18 + "There is more connecting arc.");
1.19 }
1.20 }
1.21 }
1.22 @@ -123,7 +126,8 @@
1.23 for (NodeIt trg(graph); trg != INVALID; ++trg) {
1.24 for (ConEdgeIt<Graph> con(graph, src, trg); con != INVALID; ++con) {
1.25 check( (graph.u(con) == src && graph.v(con) == trg) ||
1.26 - (graph.v(con) == src && graph.u(con) == trg), "Wrong end nodes.");
1.27 + (graph.v(con) == src && graph.u(con) == trg),
1.28 + "Wrong end nodes.");
1.29 ++found[con];
1.30 check(found[con] <= 2, "The edge found more than twice.");
1.31 }