Changes in test/graph_copy_test.cc [282:dc9e8d2c0df9:220:a5d8c039f218] in lemon-1.0
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/graph_copy_test.cc
r282 r220 64 64 ListDigraph::ArcMap<SmartDigraph::Arc> ecr(to); 65 65 66 digraphCopy(from, to).67 nodeMap( fnm, tnm).arcMap(fam, tam).66 DigraphCopy<ListDigraph, SmartDigraph>(to, from). 67 nodeMap(tnm, fnm).arcMap(tam, fam). 68 68 nodeRef(nr).arcRef(er). 69 69 nodeCrossRef(ncr).arcCrossRef(ecr). 70 node( fn, tn).arc(fa, ta).run();70 node(tn, fn).arc(ta, fa).run(); 71 71 72 72 for (SmartDigraph::NodeIt it(from); it != INVALID; ++it) { … … 139 139 ListGraph::EdgeMap<SmartGraph::Edge> ecr(to); 140 140 141 graphCopy(from, to).142 nodeMap( fnm, tnm).arcMap(fam, tam).edgeMap(fem, tem).141 GraphCopy<ListGraph, SmartGraph>(to, from). 142 nodeMap(tnm, fnm).arcMap(tam, fam).edgeMap(tem, fem). 143 143 nodeRef(nr).arcRef(ar).edgeRef(er). 144 144 nodeCrossRef(ncr).arcCrossRef(acr).edgeCrossRef(ecr). 145 node( fn, tn).arc(fa, ta).edge(fe, te).run();145 node(tn, fn).arc(ta, fa).edge(te, fe).run(); 146 146 147 147 for (SmartGraph::NodeIt it(from); it != INVALID; ++it) {
Note: See TracChangeset
for help on using the changeset viewer.