lemon/graph_adaptor.h
changeset 2630 d239741cfd44
parent 2553 bfced05fa852
equal deleted inserted replaced
50:c96807c3526e 51:c2156338f621
   111     void clear() const { graph->clear(); }
   111     void clear() const { graph->clear(); }
   112     
   112     
   113     int id(const Node& v) const { return graph->id(v); }
   113     int id(const Node& v) const { return graph->id(v); }
   114     int id(const Edge& e) const { return graph->id(e); }
   114     int id(const Edge& e) const { return graph->id(e); }
   115 
   115 
   116     Node fromNodeId(int ix) const {
   116     Node nodeFromId(int ix) const {
   117       return graph->fromNodeId(ix);
   117       return graph->nodeFromId(ix);
   118     }
   118     }
   119 
   119 
   120     Edge fromEdgeId(int ix) const {
   120     Edge edgeFromId(int ix) const {
   121       return graph->fromEdgeId(ix);
   121       return graph->edgeFromId(ix);
   122     }
   122     }
   123 
   123 
   124     int maxNodeId() const {
   124     int maxNodeId() const {
   125       return graph->maxNodeId();
   125       return graph->maxNodeId();
   126     }
   126     }