lemon/full_graph.h
changeset 400 fa341dd6ab23
parent 355 aa75d24ba7d0
child 440 88ed40ad0d4f
equal deleted inserted replaced
2:4d96a431056d 3:1afb87746766
   304         return INVALID;
   304         return INVALID;
   305       }
   305       }
   306     }
   306     }
   307 
   307 
   308     typedef True NodeNumTag;
   308     typedef True NodeNumTag;
       
   309     typedef True ArcNumTag;
   309     typedef True EdgeNumTag;
   310     typedef True EdgeNumTag;
   310 
   311 
   311     int nodeNum() const { return _node_num; }
   312     int nodeNum() const { return _node_num; }
   312     int arcNum() const { return 2 * _edge_num; }
   313     int arcNum() const { return 2 * _edge_num; }
   313     int edgeNum() const { return _edge_num; }
   314     int edgeNum() const { return _edge_num; }
   341       return Node((arc._id & 1) == 1 ?
   342       return Node((arc._id & 1) == 1 ?
   342                   _vid(arc._id >> 1) : _uid(arc._id >> 1));
   343                   _vid(arc._id >> 1) : _uid(arc._id >> 1));
   343     }
   344     }
   344 
   345 
   345     typedef True FindEdgeTag;
   346     typedef True FindEdgeTag;
       
   347     typedef True FindArcTag;
   346 
   348 
   347     Edge findEdge(Node u, Node v, Edge prev = INVALID) const {
   349     Edge findEdge(Node u, Node v, Edge prev = INVALID) const {
   348       return prev != INVALID ? INVALID : edge(u, v);
   350       return prev != INVALID ? INVALID : edge(u, v);
   349     }
   351     }
   350 
   352