COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
02/20/05 02:02:07 (16 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/max_matching_test.cc

    r1101 r1158  
    160160        Q.pop();
    161161        for(IncEdgeIt e(g,w); e!=INVALID; ++e) {
    162           Node u=g.target(e);
     162          Node u=g.runningNode(e);
    163163          if ( pos[u]==max_matching.D && todo[u] ) {
    164164            ++comp_size;
Note: See TracChangeset for help on using the changeset viewer.