COIN-OR::LEMON - Graph Library

Changeset 585:87c34740a0ec in lemon-0.x


Ignore:
Timestamp:
05/08/04 18:00:57 (17 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@762
Message:

Some more test cases.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/dijkstra_test.cc

    r578 r585  
    7474 
    7575  check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
    76  
     76
     77
     78  for(EdgeIt e(G); G.valid(e); G.next(e)) {
     79    Node u=G.tail(e);
     80    Node v=G.head(e);
     81    check( !dijkstra_test.reached(u) ||
     82           (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
     83           "dist(head)-dist(tail)- edge_length= "
     84           << dijkstra_test.dist(v) - dijkstra_test.dist(u)
     85           - cap[e]);
     86  }
     87
     88  ///\bug This works only for integer lengths
     89  for(NodeIt v(G); G.valid(v); G.next(v))
     90    if ( dijkstra_test.reached(v) ) {
     91      Edge e=dijkstra_test.pred(v);
     92      Node u=G.tail(e);
     93      check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
     94            "Bad shortest path tree edge! Difference: "
     95            << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u)
     96                            - cap[e]));
     97    }
    7798}
Note: See TracChangeset for help on using the changeset viewer.