test/graph_test.h
 changeset 263 be8a861d3bb7 parent 228 b6732e0d38c5 child 374 49d9a36b3b84
```     1.1 --- a/test/graph_test.h	Thu Sep 11 11:10:44 2008 +0100
1.2 +++ b/test/graph_test.h	Mon Sep 15 22:28:32 2008 +0200
1.3 @@ -212,10 +212,10 @@
1.4      }
1.5      check(s == 0, "Wrong sum.");
1.6
1.7 -    map = constMap<Node>(12);
1.8 -    for (NodeIt it(G); it != INVALID; ++it) {
1.9 -      check(map[it] == 12, "Wrong operator[].");
1.10 -    }
1.11 +    // map = constMap<Node>(12);
1.12 +    // for (NodeIt it(G); it != INVALID; ++it) {
1.13 +    //   check(map[it] == 12, "Wrong operator[].");
1.14 +    // }
1.15    }
1.16
1.17    template <typename Graph>
1.18 @@ -242,10 +242,10 @@
1.19      }
1.20      check(s == 0, "Wrong sum.");
1.21
1.22 -    map = constMap<Arc>(12);
1.23 -    for (ArcIt it(G); it != INVALID; ++it) {
1.24 -      check(map[it] == 12, "Wrong operator[].");
1.25 -    }
1.26 +    // map = constMap<Arc>(12);
1.27 +    // for (ArcIt it(G); it != INVALID; ++it) {
1.28 +    //   check(map[it] == 12, "Wrong operator[].");
1.29 +    // }
1.30    }
1.31
1.32    template <typename Graph>
1.33 @@ -272,10 +272,10 @@
1.34      }
1.35      check(s == 0, "Wrong sum.");
1.36
1.37 -    map = constMap<Edge>(12);
1.38 -    for (EdgeIt it(G); it != INVALID; ++it) {
1.39 -      check(map[it] == 12, "Wrong operator[].");
1.40 -    }
1.41 +    // map = constMap<Edge>(12);
1.42 +    // for (EdgeIt it(G); it != INVALID; ++it) {
1.43 +    //   check(map[it] == 12, "Wrong operator[].");
1.44 +    // }
1.45    }
1.46
1.47
```