Changeset 1158:29961fa390a3 in lemon-0.x for src/test

Timestamp:

02/20/05 02:02:07 (20 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1559

Message:

Graph and UndirGraph? concept modifications.

• For incidence iterators ({In,Out,Inc}EdgeIt?) there is now baseNode and runningNode functions in graph interface
• For Edge in undir graphs: Edge(UndirGraph? const &, UndirEdge?, Node) constructor. Same for IncEdgeIt?
• Edge(UndirEdge?, bool) constructor is no more in the public interface. (But we need it in the developpers interface).

File:

• src/test/max_matching_test.cc (modified) (1 diff)

src/test/max_matching_test.cc

@@ -160 +160 @@
         Q.pop();
         for(IncEdgeIt e(g,w); e!=INVALID; ++e) {
-          Node u=g.target(e);
+          Node u=g.runningNode(e);
           if ( pos[u]==max_matching.D && todo[u] ) {
             ++comp_size;