Changeset 776:f2994a2b10b2 in lemon-0.x for src/test
- Timestamp:
- 08/31/04 15:40:07 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1069
- Location:
- src/test
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
src/test/dijkstra_heap_test.cc
r542 r776 57 57 58 58 EdgeIt e; 59 for(G.first(e); G.valid(e); G.next(e)) {59 for(G.first(e); e!=INVALID; ++e) { 60 60 Node u=G.tail(e); 61 61 Node v=G.head(e); … … 70 70 71 71 NodeIt v; 72 for(G.first(v); G.valid(v); G.next(v)) {72 for(G.first(v); v!=INVALID; ++v) { 73 73 if ( dijkstra_test.reached(v) ) { 74 74 Edge e=dijkstra_test.pred(v); … … 106 106 error2=0; 107 107 108 for(G.first(e); G.valid(e); G.next(e)) {108 for(G.first(e); e!=INVALID; ++e) { 109 109 Node u=G.tail(e); 110 110 Node v=G.head(e); … … 118 118 } 119 119 120 for(G.first(v); G.valid(v); G.next(v)) {120 for(G.first(v); v!=INVALID; ++v) { 121 121 if ( dijkstra_test2.reached(v) ) { 122 122 Edge e=dijkstra_test2.pred(v); -
src/test/dijkstra_test.cc
r774 r776 76 76 77 77 78 for(EdgeIt e(G); e ==INVALID; ++e) {78 for(EdgeIt e(G); e!=INVALID; ++e) { 79 79 Node u=G.tail(e); 80 80 Node v=G.head(e); … … 87 87 88 88 ///\bug This works only for integer lengths 89 for(NodeIt v(G); v ==INVALID; ++v)89 for(NodeIt v(G); v!=INVALID; ++v) 90 90 if ( dijkstra_test.reached(v) ) { 91 91 Edge e=dijkstra_test.pred(v);
Note: See TracChangeset
for help on using the changeset viewer.