COIN-OR::LEMON - Graph Library

Changeset 2386:81b47fc5c444 in lemon-0.x for lemon/bpugraph_adaptor.h


Ignore:
Timestamp:
03/02/07 19:04:28 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3217
Message:

Hard Warning checking

  • based on the remark of the ZIB user
  • we do not use -Winline
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bpugraph_adaptor.h

    r2384 r2386  
    128128
    129129    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
    130     Edge findEdge(const Node& source, const Node& target,
     130    Edge findEdge(const Node& u, const Node& v,
    131131                  const Edge& prev = INVALID) {
    132       return graph->findEdge(source, target, prev);
    133     }
    134     UEdge findUEdge(const Node& source, const Node& target,
     132      return graph->findEdge(u, v, prev);
     133    }
     134    UEdge findUEdge(const Node& u, const Node& v,
    135135                    const UEdge& prev = INVALID) {
    136       return graph->findUEdge(source, target, prev);
     136      return graph->findUEdge(u, v, prev);
    137137    }
    138138 
    139139    Node addANode() const { return graph->addANode(); }
    140140    Node addBNode() const { return graph->addBNode(); }
    141     UEdge addEdge(const Node& source, const Node& target) const {
    142       return graph->addEdge(source, target);
     141    UEdge addEdge(const Node& u, const Node& v) const {
     142      return graph->addEdge(u, v);
    143143    }
    144144
     
    157157    int id(const UEdge& e) const { return graph->id(e); }
    158158
    159     Node fromNodeId(int id) const { return graph->fromNodeId(id); }
    160     ANode nodeFromANodeId(int id) const { return graph->nodeFromANodeId(id); }
    161     BNode nodeFromBNodeId(int id) const { return graph->nodeFromBNodeId(id); }
    162     Edge fromEdgeId(int id) const { return graph->fromEdgeId(id); }
    163     UEdge fromUEdgeId(int id) const { return graph->fromUEdgeId(id); }
     159    Node fromNodeId(int ix) const { return graph->fromNodeId(ix); }
     160    ANode nodeFromANodeId(int ix) const { return graph->nodeFromANodeId(ix); }
     161    BNode nodeFromBNodeId(int ix) const { return graph->nodeFromBNodeId(ix); }
     162    Edge fromEdgeId(int ix) const { return graph->fromEdgeId(ix); }
     163    UEdge fromUEdgeId(int ix) const { return graph->fromUEdgeId(ix); }
    164164
    165165    int maxNodeId() const { return graph->maxNodeId(); }
     
    362362    int id(const BNode& v) const { return Parent::id(v); }
    363363
    364     ANode nodeFromANodeId(int id) const { return Parent::nodeFromBNodeId(id); }
    365     BNode nodeFromBNodeId(int id) const { return Parent::nodeFromANodeId(id); }
     364    ANode nodeFromANodeId(int ix) const { return Parent::nodeFromBNodeId(ix); }
     365    BNode nodeFromBNodeId(int ix) const { return Parent::nodeFromANodeId(ix); }
    366366
    367367    int maxANodeId() const { return Parent::maxBNodeId(); }
Note: See TracChangeset for help on using the changeset viewer.