# Changeset 986:e958855b8186 in lemon for test

Ignore:
Timestamp:
06/25/10 06:20:28 (10 years ago)
Branch:
1.2
Parents:
985:f63fd24c0aea (diff), 980:bb871cb8ac06 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge bugfix #371 to branch 1.2

Files:
2 edited

Unmodified
Added
Removed
• ## test/graph_copy_test.cc

 r980 * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2008 * Copyright (C) 2003-2009 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES).
• ## test/graph_copy_test.cc

 r463 const int nn = 10; // Build a digraph SmartDigraph from; SmartDigraph::NodeMap fnm(from); } // Test digraph copy ListDigraph to; ListDigraph::NodeMap tnm(to); nodeCrossRef(ncr).arcCrossRef(ecr). node(fn, tn).arc(fa, ta).run(); check(countNodes(from) == countNodes(to), "Wrong copy."); check(countArcs(from) == countArcs(to), "Wrong copy."); for (SmartDigraph::NodeIt it(from); it != INVALID; ++it) { check(tn == nr[fn], "Wrong copy."); check(ta == er[fa], "Wrong copy."); // Test repeated copy digraphCopy(from, to).run(); check(countNodes(from) == countNodes(to), "Wrong copy."); check(countArcs(from) == countArcs(to), "Wrong copy."); } const int nn = 10; // Build a graph SmartGraph from; SmartGraph::NodeMap fnm(from); } // Test graph copy ListGraph to; ListGraph::NodeMap tnm(to); nodeCrossRef(ncr).arcCrossRef(acr).edgeCrossRef(ecr). node(fn, tn).arc(fa, ta).edge(fe, te).run(); check(countNodes(from) == countNodes(to), "Wrong copy."); check(countEdges(from) == countEdges(to), "Wrong copy."); check(countArcs(from) == countArcs(to), "Wrong copy."); for (SmartGraph::NodeIt it(from); it != INVALID; ++it) { check(ta == ar[fa], "Wrong copy."); check(te == er[fe], "Wrong copy."); // Test repeated copy graphCopy(from, to).run(); check(countNodes(from) == countNodes(to), "Wrong copy."); check(countEdges(from) == countEdges(to), "Wrong copy."); check(countArcs(from) == countArcs(to), "Wrong copy."); }
Note: See TracChangeset for help on using the changeset viewer.