1.1 --- a/test/graph_copy_test.cc	Tue Sep 23 18:42:49 2008 +0200
     1.2 +++ b/test/graph_copy_test.cc	Fri Sep 26 13:46:49 2008 +0200
     1.3 @@ -63,11 +63,11 @@
     1.4    ListDigraph::NodeMap<SmartDigraph::Node> ncr(to);
     1.5    ListDigraph::ArcMap<SmartDigraph::Arc> ecr(to);
     1.6  
     1.7 -  DigraphCopy<ListDigraph, SmartDigraph>(to, from).
     1.8 -    nodeMap(tnm, fnm).arcMap(tam, fam).
     1.9 +  digraphCopy(from, to).
    1.10 +    nodeMap(fnm, tnm).arcMap(fam, tam).
    1.11      nodeRef(nr).arcRef(er).
    1.12      nodeCrossRef(ncr).arcCrossRef(ecr).
    1.13 -    node(tn, fn).arc(ta, fa).run();
    1.14 +    node(fn, tn).arc(fa, ta).run();
    1.15  
    1.16    for (SmartDigraph::NodeIt it(from); it != INVALID; ++it) {
    1.17      check(ncr[nr[it]] == it, "Wrong copy.");
    1.18 @@ -138,11 +138,11 @@
    1.19    ListGraph::ArcMap<SmartGraph::Arc> acr(to);
    1.20    ListGraph::EdgeMap<SmartGraph::Edge> ecr(to);
    1.21  
    1.22 -  GraphCopy<ListGraph, SmartGraph>(to, from).
    1.23 -    nodeMap(tnm, fnm).arcMap(tam, fam).edgeMap(tem, fem).
    1.24 +  graphCopy(from, to).
    1.25 +    nodeMap(fnm, tnm).arcMap(fam, tam).edgeMap(fem, tem).
    1.26      nodeRef(nr).arcRef(ar).edgeRef(er).
    1.27      nodeCrossRef(ncr).arcCrossRef(acr).edgeCrossRef(ecr).
    1.28 -    node(tn, fn).arc(ta, fa).edge(te, fe).run();
    1.29 +    node(fn, tn).arc(fa, ta).edge(fe, te).run();
    1.30  
    1.31    for (SmartGraph::NodeIt it(from); it != INVALID; ++it) {
    1.32      check(ncr[nr[it]] == it, "Wrong copy.");