1.1 --- a/src/work/marci/edmonds_karp_demo.cc	Mon Mar 01 12:06:56 2004 +0000
     1.2 +++ b/src/work/marci/edmonds_karp_demo.cc	Mon Mar 01 14:33:00 2004 +0000
     1.3 @@ -10,10 +10,41 @@
     1.4  
     1.5  // Use a DIMACS max flow file as stdin.
     1.6  // read_dimacs_demo < dimacs_max_flow_file
     1.7 +
     1.8 +/*
     1.9 +  struct Ize {
    1.10 +  };
    1.11 +  
    1.12 +  struct Mize {
    1.13 +    Ize bumm;
    1.14 +  };
    1.15 +
    1.16 +  template <typename B>
    1.17 +    class Huha {
    1.18 +    public:
    1.19 +      int u;
    1.20 +      B brr;
    1.21 +    };
    1.22 +*/
    1.23 +
    1.24  int main(int, char **) {
    1.25    typedef ListGraph::NodeIt NodeIt;
    1.26    typedef ListGraph::EachEdgeIt EachEdgeIt;
    1.27  
    1.28 +/*
    1.29 +  Mize mize[10];
    1.30 +  Mize bize[0];
    1.31 +  Mize zize;
    1.32 +  typedef Mize Tize[0];
    1.33 +
    1.34 +  std::cout << &zize << " " << sizeof(mize) << sizeof(Tize) << std::endl;
    1.35 +  std::cout << sizeof(bize) << std::endl;
    1.36 +
    1.37 +
    1.38 +  Huha<Tize> k;
    1.39 +  std::cout << sizeof(k) << std::endl;
    1.40 +*/
    1.41 +
    1.42    ListGraph G;
    1.43    NodeIt s, t;
    1.44    ListGraph::EdgeMap<int> cap(G);