# HG changeset patch
# User marci
# Date 1078151580 0
# Node ID c76f1eea05d203b825f9716637e426e3ca6a0c59
# Parent  c6297c1214090b8d6a398e7d31a7ef9ec996682d
next, getNext

diff -r c6297c121409 -r c76f1eea05d2 src/work/list_graph.hh
--- a/src/work/list_graph.hh	Mon Mar 01 12:06:56 2004 +0000
+++ b/src/work/list_graph.hh	Mon Mar 01 14:33:00 2004 +0000
@@ -305,9 +305,9 @@
     bool valid(EdgeIt e) const { return e.valid(); }
     bool valid(NodeIt n) const { return n.valid(); }
     
-    template <typename It> It next(It it) const { 
-      It tmp(it); return goNext(tmp); }
-    template <typename It> It& goNext(It& it) const { return ++it; }
+    template <typename It> It getNext(It it) const { 
+      It tmp(it); return next(tmp); }
+    template <typename It> It& next(It& it) const { return ++it; }
    
 
     /* for getting id's of graph objects */
diff -r c6297c121409 -r c76f1eea05d2 src/work/marci/edmonds_karp_demo.cc
--- a/src/work/marci/edmonds_karp_demo.cc	Mon Mar 01 12:06:56 2004 +0000
+++ b/src/work/marci/edmonds_karp_demo.cc	Mon Mar 01 14:33:00 2004 +0000
@@ -10,10 +10,41 @@
 
 // Use a DIMACS max flow file as stdin.
 // read_dimacs_demo < dimacs_max_flow_file
+
+/*
+  struct Ize {
+  };
+  
+  struct Mize {
+    Ize bumm;
+  };
+
+  template <typename B>
+    class Huha {
+    public:
+      int u;
+      B brr;
+    };
+*/
+
 int main(int, char **) {
   typedef ListGraph::NodeIt NodeIt;
   typedef ListGraph::EachEdgeIt EachEdgeIt;
 
+/*
+  Mize mize[10];
+  Mize bize[0];
+  Mize zize;
+  typedef Mize Tize[0];
+
+  std::cout << &zize << " " << sizeof(mize) << sizeof(Tize) << std::endl;
+  std::cout << sizeof(bize) << std::endl;
+
+
+  Huha<Tize> k;
+  std::cout << sizeof(k) << std::endl;
+*/
+
   ListGraph G;
   NodeIt s, t;
   ListGraph::EdgeMap<int> cap(G);