... | ... |
@@ -98,13 +98,13 @@ |
98 | 98 |
|
99 | 99 |
|
100 |
for(ArcIt e(G); e |
|
100 |
for(ArcIt e(G); e!=INVALID; ++e) { |
|
101 | 101 |
Node u=G.source(e); |
102 | 102 |
Node v=G.target(e); |
103 | 103 |
check( !bfs_test.reached(u) || |
104 |
(bfs_test.dist(v) |
|
104 |
(bfs_test.dist(v) <= bfs_test.dist(u)+1), |
|
105 | 105 |
"Wrong output."); |
106 | 106 |
} |
107 | 107 |
|
108 |
for(NodeIt v(G); v |
|
108 |
for(NodeIt v(G); v!=INVALID; ++v) { |
|
109 | 109 |
check(bfs_test.reached(v),"Each node should be reached."); |
110 | 110 |
if ( bfs_test.predArc(v)!=INVALID ) { |
0 comments (0 inline)