1.1 --- a/src/hugo/dimacs.h	Wed Sep 22 12:25:50 2004 +0000
     1.2 +++ b/src/hugo/dimacs.h	Wed Sep 22 12:33:30 2004 +0000
     1.3 @@ -185,57 +185,8 @@
     1.4  
     1.5    }
     1.6  
     1.7 -
     1.8    /// @}
     1.9  
    1.10  } //namespace hugo
    1.11  
    1.12  #endif //HUGO_DIMACS_H
    1.13 -
    1.14 -//  template<typename Graph, typename CapacityMap>
    1.15 -//   void readDimacsMaxFlow(std::istream& is, Graph &g, 
    1.16 -// 			 typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) {
    1.17 -//     g.clear();
    1.18 -//     int cap;
    1.19 -//     char d;
    1.20 -//     std::string problem;
    1.21 -//     char c;
    1.22 -//     int i, j;
    1.23 -//     std::string str;
    1.24 -//     int n, m; 
    1.25 -//     typename Graph::Edge e;
    1.26 -//     std::vector<typename Graph::Node> nodes;
    1.27 -//     while (is>>c) {
    1.28 -//       switch (c) {
    1.29 -//       case 'c': //comment
    1.30 -// 	getline(is, str);
    1.31 -// 	break;
    1.32 -//       case 'p': //problem definition
    1.33 -// 	is >> problem >> n >> m;
    1.34 -// 	getline(is, str);
    1.35 -// 	nodes.resize(n+1);
    1.36 -// 	for (int k=1; k<=n; ++k) nodes[k]=g.addNode();
    1.37 -// 	break;
    1.38 -//       case 'n': //node definition
    1.39 -// 	if (problem=="sp") { //shortest path problem
    1.40 -// 	  is >> i;
    1.41 -// 	  getline(is, str);
    1.42 -// 	  s=nodes[i];
    1.43 -// 	}
    1.44 -// 	if (problem=="max") { //max flow problem
    1.45 -// 	  is >> i >> d;
    1.46 -// 	  getline(is, str);
    1.47 -// 	  if (d=='s') s=nodes[i];
    1.48 -// 	  if (d=='t') t=nodes[i];
    1.49 -// 	}
    1.50 -// 	break;
    1.51 -//       case 'a':
    1.52 -// 	is >> i >> j >> cap;
    1.53 -// 	getline(is, str);
    1.54 -// 	e=g.addEdge(nodes[i], nodes[j]);
    1.55 -// 	capacity.update();
    1.56 -// 	capacity.set(e, cap);
    1.57 -// 	break;
    1.58 -//       }
    1.59 -//     }
    1.60 -//   }