[Lemon-commits] [lemon_svn] marci: r29 - hugo/trunk/src/work

[Lemon SVN]

Author: marci
Date: Fri Jan 16 12:21:47 2004
New Revision: 29

Modified:
   hugo/trunk/src/work/marci_list_graph.hh

Log:
*** empty log message ***


Modified: hugo/trunk/src/work/marci_list_graph.hh
==============================================================================
--- hugo/trunk/src/work/marci_list_graph.hh	(original)
+++ hugo/trunk/src/work/marci_list_graph.hh	Fri Jan 16 12:21:47 2004
@@ -137,11 +137,11 @@
     node_iterator b_node(const in_edge_iterator& e) { return e.b_node(); }
     node_iterator b_node(const sym_edge_iterator& e) { return e.b_node(); }
 
-    node_iterator invalid_node() { return node_iterator(); }
-    edge_iterator invalid_edge() { return edge_iterator(); }
-    out_edge_iterator invalid_out_edge() { return out_edge_iterator(); }
-    in_edge_iterator invalid_in_edge() { return in_edge_iterator(); }
-    sym_edge_iterator invalid_sym_edge() { return sym_edge_iterator(); }
+    //node_iterator invalid_node() { return node_iterator(); }
+    //edge_iterator invalid_edge() { return edge_iterator(); }
+    //out_edge_iterator invalid_out_edge() { return out_edge_iterator(); }
+    //in_edge_iterator invalid_in_edge() { return in_edge_iterator(); }
+    //sym_edge_iterator invalid_sym_edge() { return sym_edge_iterator(); }
 
     /* same methods in other style */
     /* for experimental purpose */
@@ -166,11 +166,11 @@
     void get_b_node(node_iterator& n, const out_edge_iterator& e) { n=e.b_node(); }
     void get_b_node(node_iterator& n, const in_edge_iterator& e) { n=e.b_node(); }
     void get_b_node(node_iterator& n, const sym_edge_iterator& e) { n=e.b_node(); }
-    void get_invalid(node_iterator& n) { n=node_iterator(); }
-    void get_invalid(edge_iterator& e) { e=edge_iterator(); }
-    void get_invalid(out_edge_iterator& e) { e=out_edge_iterator(); }
-    void get_invalid(in_edge_iterator& e) { e=in_edge_iterator(); }
-    void get_invalid(sym_edge_iterator& e) { e=sym_edge_iterator(); }
+    //void get_invalid(node_iterator& n) { n=node_iterator(); }
+    //void get_invalid(edge_iterator& e) { e=edge_iterator(); }
+    //void get_invalid(out_edge_iterator& e) { e=out_edge_iterator(); }
+    //void get_invalid(in_edge_iterator& e) { e=in_edge_iterator(); }
+    //void get_invalid(sym_edge_iterator& e) { e=sym_edge_iterator(); }
 
 
     /* for getting id's of graph objects */
@@ -210,6 +210,7 @@
       node_iterator() : node(0) { }
       node_iterator(node_item* _node) : node(_node) { }
       bool is_valid() { return (node!=0); }
+      void make_invalid() { node=0; }
       friend bool operator==(const node_iterator& u, const node_iterator& v) { 
 	return v.node==u.node; 
       } 
@@ -239,6 +240,7 @@
       edge_iterator() : edge(0) { }
       edge_iterator(edge_item* _edge) : edge(_edge) { }
       bool is_valid() { return (edge!=0); }
+      void make_invalid() { edge=0; }
       friend bool operator==(const edge_iterator& u, const edge_iterator& v) { 
 	return v.edge==u.edge; 
       }