Changeset 129:1630a5b631c8 in lemon-0.x for src

Timestamp:

02/25/04 16:26:39 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@176

Message:

setInvalid() functions added.

File:

• src/work/alpar/smart_graph.h (modified) (4 diffs)

src/work/alpar/smart_graph.h

@@ -6 +6 @@
 #include <iostream>
 #include <vector>
+#include <limits.h>
 
 namespace hugo {
@@ -11 +12 @@
   class SmartGraph {
 
-    static const int INVALID=-1;
+    static const int INVALID_EDGE=-1;
+    static const int INVALID_NODE=INT_MAX;
 
     struct NodeT 
     {
       int first_in,first_out;      
-      NodeT() : first_in(INVALID), first_out(INVALID) {}
+      NodeT() : first_in(INVALID_EDGE), first_out(INVALID_EDGE) {}
     };
     struct EdgeT 
@@ -22 +24 @@
       int head, tail, next_in, next_out;      
       //FIXME: is this necessary?
-      EdgeT() : next_in(INVALID), next_out(INVALID) {}  
+      EdgeT() : next_in(INVALID_EDGE), next_out(INVALID_EDGE) {}  
     };
 
     std::vector<NodeT> nodes;
+
     std::vector<EdgeT> edges;
     
@@ -124 +127 @@
     }
 
-    bool valid(EdgeIt e) const { return e.n!=INVALID; }
+    bool valid(EdgeIt e) const { return e.n!=INVALID_EDGE; }
     bool valid(EachEdgeIt e) const { return e.n<int(edges.size()); }
     bool valid(NodeIt n) const { return n.n<int(nodes.size()); }
+    
+    void setInvalid(EdgeIt &e) { e.n=INVALID_EDGE; }
+    void setInvalid(NodeIt &e) { e.n=INVALID_NODE; }
     
     template <typename It> It next(It it) const