COIN-OR::LEMON - Graph Library

Changeset 282:dc9e8d2c0df9 in lemon-1.2 for test


Ignore:
Timestamp:
09/26/08 13:46:49 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Using from-to order in graph copying tools + doc improvements (ticket #150)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/graph_copy_test.cc

    r220 r282  
    6464  ListDigraph::ArcMap<SmartDigraph::Arc> ecr(to);
    6565
    66   DigraphCopy<ListDigraph, SmartDigraph>(to, from).
    67     nodeMap(tnm, fnm).arcMap(tam, fam).
     66  digraphCopy(from, to).
     67    nodeMap(fnm, tnm).arcMap(fam, tam).
    6868    nodeRef(nr).arcRef(er).
    6969    nodeCrossRef(ncr).arcCrossRef(ecr).
    70     node(tn, fn).arc(ta, fa).run();
     70    node(fn, tn).arc(fa, ta).run();
    7171
    7272  for (SmartDigraph::NodeIt it(from); it != INVALID; ++it) {
     
    139139  ListGraph::EdgeMap<SmartGraph::Edge> ecr(to);
    140140
    141   GraphCopy<ListGraph, SmartGraph>(to, from).
    142     nodeMap(tnm, fnm).arcMap(tam, fam).edgeMap(tem, fem).
     141  graphCopy(from, to).
     142    nodeMap(fnm, tnm).arcMap(fam, tam).edgeMap(fem, tem).
    143143    nodeRef(nr).arcRef(ar).edgeRef(er).
    144144    nodeCrossRef(ncr).arcCrossRef(acr).edgeCrossRef(ecr).
    145     node(tn, fn).arc(ta, fa).edge(te, fe).run();
     145    node(fn, tn).arc(fa, ta).edge(fe, te).run();
    146146
    147147  for (SmartGraph::NodeIt it(from); it != INVALID; ++it) {
Note: See TracChangeset for help on using the changeset viewer.