COIN-OR::LEMON - Graph Library

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


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/lemon/max_matching.h

    r1093 r1158  
    181181          Node u=_mate[v];
    182182          for(IncEdgeIt e(g,v); e!=INVALID; ++e) {
    183             if ( g.target(e) == u ) {
     183            if ( g.runningNode(e) == u ) {
    184184              map.set(u,e);
    185185              map.set(v,e);
     
    228228          Node u=_mate[v];
    229229          for(IncEdgeIt e(g,v); e!=INVALID; ++e) {
    230             if ( g.target(e) == u ) {
     230            if ( g.runningNode(e) == u ) {
    231231              map.set(e,true);
    232232              todo.set(u,false);
     
    333333       
    334334      for( IncEdgeIt e(g,x); e!=INVALID ; ++e ) {
    335         Node y=g.target(e);
     335        Node y=g.runningNode(e);
    336336
    337337        if ( position[y] == D && blossom.find(x) != blossom.find(y) ) {
     
    389389       
    390390      for( IncEdgeIt e(g,x); e!=INVALID; ++e ) {
    391         Node y=g.target(e);
     391        Node y=g.runningNode(e);
    392392             
    393393        switch ( position[y] ) {
     
    454454      if ( _mate[v]==INVALID ) {
    455455        for( IncEdgeIt e(g,v); e!=INVALID ; ++e ) {
    456           Node y=g.target(e);
     456          Node y=g.runningNode(e);
    457457          if ( _mate[y]==INVALID && y!=v ) {
    458458            _mate.set(v,y);
     
    485485                                        UFE& blossom, UFE& tree, std::queue<Node>& Q) {
    486486    for( IncEdgeIt e(g,x); e!= INVALID; ++e ) {
    487       Node y=g.target(e);
     487      Node y=g.runningNode(e);
    488488       
    489489      if ( position[y]==C ) {
Note: See TracChangeset for help on using the changeset viewer.