author Peter Kovacs Mon, 12 Jan 2009 23:11:39 +0100 changeset 504 c35afa9e89e7 parent 469 04c0631fd332 child 783 ef88c0a30f85
 test/adaptors_test.cc file | annotate | diff | comparison | revisions
```     1.1 --- a/test/adaptors_test.cc	Mon Jan 12 13:37:37 2009 +0000
1.2 +++ b/test/adaptors_test.cc	Mon Jan 12 23:11:39 2009 +0100
1.3 @@ -1371,51 +1371,43 @@
1.4    GridGraph::Node n4 = graph(1,1);
1.5
1.6    GridGraph::EdgeMap<bool> dir_map(graph);
1.7 -  dir_map[graph.right(n1)] = graph.u(graph.right(n1)) == n1;
1.8 -  dir_map[graph.up(n1)] = graph.u(graph.up(n1)) != n1;
1.9 -  dir_map[graph.left(n4)] = graph.u(graph.left(n4)) != n4;
1.10 -  dir_map[graph.down(n4)] = graph.u(graph.down(n4)) != n4;
1.11 +  dir_map[graph.right(n1)] = graph.u(graph.right(n1)) != n1;
1.12 +  dir_map[graph.up(n1)] = graph.u(graph.up(n1)) == n1;
1.13 +  dir_map[graph.left(n4)] = graph.u(graph.left(n4)) == n4;
1.14 +  dir_map[graph.down(n4)] = graph.u(graph.down(n4)) == n4;
1.15
1.16    // Apply several adaptors on the grid graph
1.17 -  typedef SplitNodes< ReverseDigraph< const Orienter<
1.18 -            const GridGraph, GridGraph::EdgeMap<bool> > > >
1.19 -    RevSplitGridGraph;
1.20 -  typedef ReverseDigraph<const RevSplitGridGraph> SplitGridGraph;
1.21 +  typedef SplitNodes<Orienter< const GridGraph, GridGraph::EdgeMap<bool> > >
1.22 +    SplitGridGraph;
1.23    typedef Undirector<const SplitGridGraph> USplitGridGraph;
1.24 -  typedef Undirector<const USplitGridGraph> UUSplitGridGraph;
1.25 -  checkConcept<concepts::Digraph, RevSplitGridGraph>();
1.26    checkConcept<concepts::Digraph, SplitGridGraph>();
1.27    checkConcept<concepts::Graph, USplitGridGraph>();
1.28 -  checkConcept<concepts::Graph, UUSplitGridGraph>();
1.29
1.31 -    splitNodes(reverseDigraph(orienter(graph, dir_map)));
1.33 +  SplitGridGraph adaptor = splitNodes(orienter(graph, dir_map));
1.36
1.41
1.58
1.75
1.78 @@ -1438,29 +1430,14 @@
1.81
1.90 -
1.97 -
1.101 -