Changeset 780:e06d0d16595f in lemon-0.x for src/test/dijkstra_test.cc
- Timestamp:
- 09/01/04 17:08:41 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1073
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/test/dijkstra_test.cc
r776 r780 87 87 88 88 ///\bug This works only for integer lengths 89 for(NodeIt v(G); v!=INVALID; ++v) 90 if ( dijkstra_test.reached(v) ) { 89 for(NodeIt v(G); v!=INVALID; ++v){ 90 check(dijkstra_test.reached(v),"Each node should be reached."); 91 if ( dijkstra_test.pred(v)!=INVALID ) { 91 92 Edge e=dijkstra_test.pred(v); 92 93 Node u=G.tail(e); 94 check(u==dijkstra_test.predNode(v),"Wrong tree."); 93 95 check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e], 94 " Bad shortest path tree edge! Difference: "96 "Wrong distance! Difference: " 95 97 << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) 96 98 - cap[e])); 97 99 } 100 } 98 101 } 102
Note: See TracChangeset
for help on using the changeset viewer.