COIN-OR::LEMON - Graph Library

Changeset 1729:06f939455cb1 in lemon-0.x for test


Ignore:
Timestamp:
10/17/05 12:28:48 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2256
Message:

Removing signal/commit Change from alteration notifier

It makes slower the change Target/Source? functions
and used only by the In/Out? DegMap?

File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/graph_utils_test.cc

    r1728 r1729  
    8383    ListGraph graph;
    8484    InDegMap<ListGraph> inDeg(graph);
     85    OutDegMap<ListGraph> outDeg(graph);
    8586    std::vector<ListGraph::Node> nodes(nodeNum);
    8687    for (int i = 0; i < nodeNum; ++i) {
     
    9697            "Wrong in degree map");
    9798    }
    98     for (int i = 0; i < edgeNum; ++i) {
    99       graph.changeTarget(edges[i], nodes[urandom(nodeNum)]);
    100     }
    10199    for (int i = 0; i < nodeNum; ++i) {
    102       check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]),
    103             "Wrong in degree map");
    104     }
    105     for (int i = 0; i < edgeNum; ++i) {
    106       graph.changeSource(edges[i], nodes[urandom(nodeNum)]);
    107     }
    108     for (int i = 0; i < nodeNum; ++i) {
    109       check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]),
    110             "Wrong in degree map");
    111     }
    112     for (int i = 0; i < edgeNum; ++i) {
    113       graph.reverseEdge(edges[i]);
    114     }
    115     for (int i = 0; i < nodeNum; ++i) {
    116       check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]),
     100      check(outDeg[nodes[i]] == countOutEdges(graph, nodes[i]),
    117101            "Wrong in degree map");
    118102    }
Note: See TracChangeset for help on using the changeset viewer.