COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/bfs_test.cc

    r209 r222  
    9898
    9999
    100   for(ArcIt e(G); e==INVALID; ++e) {
     100  for(ArcIt e(G); e!=INVALID; ++e) {
    101101    Node u=G.source(e);
    102102    Node v=G.target(e);
    103103    check( !bfs_test.reached(u) ||
    104            (bfs_test.dist(v) > bfs_test.dist(u)+1),
     104           (bfs_test.dist(v) <= bfs_test.dist(u)+1),
    105105           "Wrong output.");
    106106  }
    107107
    108   for(NodeIt v(G); v==INVALID; ++v) {
     108  for(NodeIt v(G); v!=INVALID; ++v) {
    109109    check(bfs_test.reached(v),"Each node should be reached.");
    110110    if ( bfs_test.predArc(v)!=INVALID ) {
Note: See TracChangeset for help on using the changeset viewer.