1.1 --- a/lemon/list_graph.h	Fri Feb 24 11:02:11 2006 +0000
     1.2 +++ b/lemon/list_graph.h	Fri Feb 24 11:13:09 2006 +0000
     1.3 @@ -716,7 +716,7 @@
     1.4        node.id =  first_bnode != -1 ? (first_bnode << 1) + 1 : -1;
     1.5      }
     1.6      void nextBNode(Node& node) const {
     1.7 -      node.id = aNodes[node.id >> 1].next_node;
     1.8 +      node.id = bNodes[node.id >> 1].next_node;
     1.9      }
    1.10  
    1.11      void first(Node& node) const {
    1.12 @@ -861,7 +861,7 @@
    1.13  
    1.14      Node addBNode() {
    1.15        int bNodeId;
    1.16 -      if (first_free_anode == -1) {
    1.17 +      if (first_free_bnode == -1) {
    1.18          bNodeId = bNodes.size();
    1.19          bNodes.push_back(NodeT());
    1.20        } else {