COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
07/13/08 21:09:47 (11 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:
1 edited

Legend:

Unmodified
Added
Removed
  • test/graph_utils_test.cc

    r209 r210  
    9393        Arc con3 = al3(src, trg);
    9494        Arc con4 = findArc(fg, src, trg);
    95         check(con1 == con2 && con2 == con3 && con3 == con4, "Different results.")
     95        check(con1 == con2 && con2 == con3 && con3 == con4,
     96              "Different results.")
    9697        check(con1 != INVALID, "There is no connecting arc.");
    9798        check(fg.source(con1) == src, "Wrong source.");
    9899        check(fg.target(con1) == trg, "Wrong target.");
    99         check(al3(src, trg, con3) == INVALID, "There is more connecting arc.");
    100         check(findArc(fg, src, trg, con4) == INVALID, "There is more connecting arc.");
     100        check(al3(src, trg, con3) == INVALID,
     101              "There is more connecting arc.");
     102        check(findArc(fg, src, trg, con4) == INVALID,
     103              "There is more connecting arc.");
    101104      }
    102105    }
     
    124127      for (ConEdgeIt<Graph> con(graph, src, trg); con != INVALID; ++con) {
    125128        check( (graph.u(con) == src && graph.v(con) == trg) ||
    126                (graph.v(con) == src && graph.u(con) == trg), "Wrong end nodes.");
     129               (graph.v(con) == src && graph.u(con) == trg),
     130               "Wrong end nodes.");
    127131        ++found[con];
    128132        check(found[con] <= 2, "The edge found more than twice.");
Note: See TracChangeset for help on using the changeset viewer.