COIN-OR::LEMON - Graph Library

Changeset 2231:06faf3f06d67 in lemon-0.x for lemon/bpugraph_adaptor.h


Ignore:
Timestamp:
10/03/06 13:46:39 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2973
Message:

Some rearrangement of concepts and extenders
BpUGraph concepts and concept check test

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bpugraph_adaptor.h

    r2084 r2231  
    8888      graph->firstInc(i, d, n);
    8989    }
     90    void firstFromANode(UEdge& i, const Node& n) const {
     91      graph->firstFromANode(i, n);
     92    }
     93    void firstFromBNode(UEdge& i, const Node& n) const {
     94      graph->firstFromBNode(i, n);
     95    }
    9096
    9197    void next(Node& i) const { graph->next(i); }
     
    97103    void nextOut(Edge& i) const { graph->nextOut(i); }
    98104    void nextInc(UEdge &i, bool &d) const { graph->nextInc(i, d); }
     105    void nextFromANode(UEdge& i) const { graph->nextFromANode(i); }
     106    void nextFromBNode(UEdge& i) const { graph->nextFromBNode(i); }
    99107
    100108    Node source(const UEdge& e) const { return graph->source(e); }
     
    150158
    151159    Node fromNodeId(int id) const { return graph->fromNodeId(id); }
    152     ANode fromANodeId(int id) const { return graph->fromANodeId(id); }
    153     BNode fromBNodeId(int id) const { return graph->fromBNodeId(id); }
     160    ANode nodeFromANodeId(int id) const { return graph->nodeFromANodeId(id); }
     161    BNode nodeFromBNodeId(int id) const { return graph->nodeFromBNodeId(id); }
    154162    Edge fromEdgeId(int id) const { return graph->fromEdgeId(id); }
    155163    UEdge fromUEdgeId(int id) const { return graph->fromUEdgeId(id); }
     
    341349    void nextBNode(Node& i) const { Parent::nextANode(i); }
    342350
     351    void firstFromANode(UEdge& i, const Node& n) const {
     352      Parent::firstFromBNode(i, n);
     353    }
     354    void firstFromBNode(UEdge& i, const Node& n) const {
     355      Parent::firstFromANode(i, n);
     356    }
     357
     358    void nextFromANode(UEdge& i) const { Parent::nextFromBNode(i); }
     359    void nextFromBNode(UEdge& i) const { Parent::nextFromANode(i); }
     360
    343361    int id(const ANode& v) const { return Parent::id(v); }
    344362    int id(const BNode& v) const { return Parent::id(v); }
    345363
    346     ANode fromANodeId(int id) const { return Parent::fromBNodeId(id); }
    347     BNode fromBNodeId(int id) const { return Parent::fromANodeId(id); }
     364    ANode nodeFromANodeId(int id) const { return Parent::nodeFromBNodeId(id); }
     365    BNode nodeFromBNodeId(int id) const { return Parent::nodeFromANodeId(id); }
    348366
    349367    int maxANodeId() const { return Parent::maxBNodeId(); }
     
    550568  /// the residual graph of the matching.
    551569  template <typename _BpUGraph,
    552             typename _ANMatchingMap, typename _BNMatchingMap>
     570            typename _ANMatchingMap =
     571            typename _BpUGraph::template ANodeMap<typename _BpUGraph::UEdge>,
     572            typename _BNMatchingMap =
     573            typename _BpUGraph::template BNodeMap<typename _BpUGraph::UEdge> >
    553574  class MatchingBpUGraphAdaptor
    554575    : public BpUGraphAdaptorExtender<
Note: See TracChangeset for help on using the changeset viewer.