Changeset 177:924f9555711d in lemon-0.x for src/work/alpar/smart_graph.h

Timestamp:

03/12/04 16:42:51 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Marci's changes accepted.

File:

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

src/work/alpar/smart_graph.h

@@ -12 +12 @@
 
   class SmartGraph {
-
-//     static const int INVALID=-1;
-//     static const int INVALID_NODE=INT_MAX;
 
     struct NodeT 
@@ -117 +114 @@
 
     template< typename It >
-    It first() const { 
-      It e;
-      //Marci
-      /*getF*/first(e);
-      return e; 
-    }
+    It first() const { It e; first(e); return e; }
 
     template< typename It >
-    It first(Node v) const { 
-      It e;
-      //Marci
-      /*getF*/first(e, v);
-      return e; 
-    }
+    It first(Node v) const { It e; first(e,v); return e; }
 
     bool valid(Edge e) const { return e.n!=-1; }
-    //    bool valid(EdgeIt e) const { return e.n<int(edges.size()); }
     bool valid(Node n) const { return n.n!=-1; }
     
@@ -141 +127 @@
     template <typename It> It getNext(It it) const
     { It tmp(it); return next(tmp); }
-    //{ It tmp; tmp.n=it.n+1; return tmp; }
-
-    //FIXME correction Marci: I changed to NodeIt from Node
-    //NodeIt& next(NodeIt& it) const { it.n=(it.n+2)%nodes.size()-1; return it; }
+
     NodeIt& next(NodeIt& it) const { 
       it.n=(it.n+2)%(nodes.size()+1)-1; 
@@ -226 +209 @@
     public:
       Edge() { }
-      // Marci: kiszedtem az Invalid i-bol az i-t 
       Edge (Invalid) { n=-1; }
       bool operator==(const Edge i) const {return n==i.n;}
@@ -331 +313 @@
         if(k.n>=container.size()) container.resize(k.n+1);
       }
+
 //       void erase(const Node k)
 //       {