1.1 --- a/src/include/dimacs.h	Wed May 05 08:18:19 2004 +0000
     1.2 +++ b/src/include/dimacs.h	Wed May 05 08:36:00 2004 +0000
     1.3 @@ -85,7 +85,7 @@
     1.4    void readDimacs(std::istream& is, Graph &g, CapacityMap& capacity) {
     1.5      typename Graph::Node u;
     1.6      NullMap<typename Graph::Edge, int> n;
     1.7 -    readDimacs(is, g, cap, u, u, n);
     1.8 +    readDimacs(is, g, capacity, u, u, n);
     1.9    }
    1.10  
    1.11    /// shortest path problem