1.1 --- a/src/work/marci_list_graph.hh	Fri Jan 16 11:20:09 2004 +0000
     1.2 +++ b/src/work/marci_list_graph.hh	Fri Jan 16 11:21:47 2004 +0000
     1.3 @@ -137,11 +137,11 @@
     1.4      node_iterator b_node(const in_edge_iterator& e) { return e.b_node(); }
     1.5      node_iterator b_node(const sym_edge_iterator& e) { return e.b_node(); }
     1.6  
     1.7 -    node_iterator invalid_node() { return node_iterator(); }
     1.8 -    edge_iterator invalid_edge() { return edge_iterator(); }
     1.9 -    out_edge_iterator invalid_out_edge() { return out_edge_iterator(); }
    1.10 -    in_edge_iterator invalid_in_edge() { return in_edge_iterator(); }
    1.11 -    sym_edge_iterator invalid_sym_edge() { return sym_edge_iterator(); }
    1.12 +    //node_iterator invalid_node() { return node_iterator(); }
    1.13 +    //edge_iterator invalid_edge() { return edge_iterator(); }
    1.14 +    //out_edge_iterator invalid_out_edge() { return out_edge_iterator(); }
    1.15 +    //in_edge_iterator invalid_in_edge() { return in_edge_iterator(); }
    1.16 +    //sym_edge_iterator invalid_sym_edge() { return sym_edge_iterator(); }
    1.17  
    1.18      /* same methods in other style */
    1.19      /* for experimental purpose */
    1.20 @@ -166,11 +166,11 @@
    1.21      void get_b_node(node_iterator& n, const out_edge_iterator& e) { n=e.b_node(); }
    1.22      void get_b_node(node_iterator& n, const in_edge_iterator& e) { n=e.b_node(); }
    1.23      void get_b_node(node_iterator& n, const sym_edge_iterator& e) { n=e.b_node(); }
    1.24 -    void get_invalid(node_iterator& n) { n=node_iterator(); }
    1.25 -    void get_invalid(edge_iterator& e) { e=edge_iterator(); }
    1.26 -    void get_invalid(out_edge_iterator& e) { e=out_edge_iterator(); }
    1.27 -    void get_invalid(in_edge_iterator& e) { e=in_edge_iterator(); }
    1.28 -    void get_invalid(sym_edge_iterator& e) { e=sym_edge_iterator(); }
    1.29 +    //void get_invalid(node_iterator& n) { n=node_iterator(); }
    1.30 +    //void get_invalid(edge_iterator& e) { e=edge_iterator(); }
    1.31 +    //void get_invalid(out_edge_iterator& e) { e=out_edge_iterator(); }
    1.32 +    //void get_invalid(in_edge_iterator& e) { e=in_edge_iterator(); }
    1.33 +    //void get_invalid(sym_edge_iterator& e) { e=sym_edge_iterator(); }
    1.34  
    1.35  
    1.36      /* for getting id's of graph objects */
    1.37 @@ -210,6 +210,7 @@
    1.38        node_iterator() : node(0) { }
    1.39        node_iterator(node_item* _node) : node(_node) { }
    1.40        bool is_valid() { return (node!=0); }
    1.41 +      void make_invalid() { node=0; }
    1.42        friend bool operator==(const node_iterator& u, const node_iterator& v) { 
    1.43  	return v.node==u.node; 
    1.44        } 
    1.45 @@ -239,6 +240,7 @@
    1.46        edge_iterator() : edge(0) { }
    1.47        edge_iterator(edge_item* _edge) : edge(_edge) { }
    1.48        bool is_valid() { return (edge!=0); }
    1.49 +      void make_invalid() { edge=0; }
    1.50        friend bool operator==(const edge_iterator& u, const edge_iterator& v) { 
    1.51  	return v.edge==u.edge; 
    1.52        }