Changeset 1763:49045f2d28d4 in lemon-0.x for test
- Timestamp:
- 11/04/05 15:48:10 (15 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2295
- Location:
- test
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
test/all_pairs_shortest_path_test.cc
r1745 r1763 89 89 check(johnson.dist(it, jt) == 90 90 johnson.dist(it, johnson.predNode(it, jt)) + 91 length[johnson.pred (it, jt)],91 length[johnson.predEdge(it, jt)], 92 92 "Wrong edge in all pairs shortest path"); 93 93 check(fibJohnson.dist(it, jt) == 94 94 fibJohnson.dist(it, fibJohnson.predNode(it, jt)) + 95 length[fibJohnson.pred (it, jt)],95 length[fibJohnson.predEdge(it, jt)], 96 96 "Wrong edge in all pairs shortest path"); 97 97 check(floyd.dist(it, jt) == 98 98 floyd.dist(it, floyd.predNode(it, jt)) + 99 length[floyd.pred (it, jt)],99 length[floyd.predEdge(it, jt)], 100 100 "Wrong edge in all pairs shortest path"); 101 101 } -
test/bfs_test.cc
r1435 r1763 51 51 52 52 l = bfs_test.dist(n); 53 e = bfs_test.pred (n);53 e = bfs_test.predEdge(n); 54 54 n = bfs_test.predNode(n); 55 55 d = bfs_test.distMap(); … … 122 122 for(NodeIt v(G); v==INVALID; ++v) { 123 123 check(bfs_test.reached(v),"Each node should be reached."); 124 if ( bfs_test.pred (v)!=INVALID ) {125 Edge e=bfs_test.pred (v);124 if ( bfs_test.predEdge(v)!=INVALID ) { 125 Edge e=bfs_test.predEdge(v); 126 126 Node u=G.source(e); 127 127 check(u==bfs_test.predNode(v),"Wrong tree."); -
test/dfs_test.cc
r1435 r1763 51 51 52 52 l = dfs_test.dist(n); 53 e = dfs_test.pred (n);53 e = dfs_test.predEdge(n); 54 54 n = dfs_test.predNode(n); 55 55 d = dfs_test.distMap(); … … 112 112 for(NodeIt v(G); v!=INVALID; ++v) { 113 113 check(dfs_test.reached(v),"Each node should be reached."); 114 if ( dfs_test.pred (v)!=INVALID ) {115 Edge e=dfs_test.pred (v);114 if ( dfs_test.predEdge(v)!=INVALID ) { 115 Edge e=dfs_test.predEdge(v); 116 116 Node u=G.source(e); 117 117 check(u==dfs_test.predNode(v),"Wrong tree."); -
test/dijkstra_test.cc
r1435 r1763 55 55 56 56 l = dijkstra_test.dist(n); 57 e = dijkstra_test.pred (n);57 e = dijkstra_test.predEdge(n); 58 58 n = dijkstra_test.predNode(n); 59 59 d = dijkstra_test.distMap(); … … 136 136 for(NodeIt v(G); v!=INVALID; ++v){ 137 137 check(dijkstra_test.reached(v),"Each node should be reached."); 138 if ( dijkstra_test.pred (v)!=INVALID ) {139 Edge e=dijkstra_test.pred (v);138 if ( dijkstra_test.predEdge(v)!=INVALID ) { 139 Edge e=dijkstra_test.predEdge(v); 140 140 Node u=G.source(e); 141 141 check(u==dijkstra_test.predNode(v),"Wrong tree."); -
test/heap_test.h
r1745 r1763 94 94 95 95 for(NodeIt v(graph); v!=INVALID; ++v) { 96 if ( dijkstra.reached(v) && dijkstra.pred (v) != INVALID ) {97 Edge e=dijkstra.pred (v);96 if ( dijkstra.reached(v) && dijkstra.predEdge(v) != INVALID ) { 97 Edge e=dijkstra.predEdge(v); 98 98 Node u=graph.source(e); 99 99 check( dijkstra.dist(v) - dijkstra .dist(u) == length[e],
Note: See TracChangeset
for help on using the changeset viewer.