# HG changeset patch
# User alpar
# Date 1095856410 0
# Node ID 2e664d4969d7f5c821aee4d82e39a04d589e2b9e
# Parent  309d81806228088bfb8f07fcd58c2c101c723e7a
Some commenticide was applied.

diff -r 309d81806228 -r 2e664d4969d7 src/hugo/dimacs.h
--- a/src/hugo/dimacs.h	Wed Sep 22 12:25:50 2004 +0000
+++ b/src/hugo/dimacs.h	Wed Sep 22 12:33:30 2004 +0000
@@ -185,57 +185,8 @@
 
   }
 
-
   /// @}
 
 } //namespace hugo
 
 #endif //HUGO_DIMACS_H
-
-//  template<typename Graph, typename CapacityMap>
-//   void readDimacsMaxFlow(std::istream& is, Graph &g, 
-// 			 typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) {
-//     g.clear();
-//     int cap;
-//     char d;
-//     std::string problem;
-//     char c;
-//     int i, j;
-//     std::string str;
-//     int n, m; 
-//     typename Graph::Edge e;
-//     std::vector<typename Graph::Node> nodes;
-//     while (is>>c) {
-//       switch (c) {
-//       case 'c': //comment
-// 	getline(is, str);
-// 	break;
-//       case 'p': //problem definition
-// 	is >> problem >> n >> m;
-// 	getline(is, str);
-// 	nodes.resize(n+1);
-// 	for (int k=1; k<=n; ++k) nodes[k]=g.addNode();
-// 	break;
-//       case 'n': //node definition
-// 	if (problem=="sp") { //shortest path problem
-// 	  is >> i;
-// 	  getline(is, str);
-// 	  s=nodes[i];
-// 	}
-// 	if (problem=="max") { //max flow problem
-// 	  is >> i >> d;
-// 	  getline(is, str);
-// 	  if (d=='s') s=nodes[i];
-// 	  if (d=='t') t=nodes[i];
-// 	}
-// 	break;
-//       case 'a':
-// 	is >> i >> j >> cap;
-// 	getline(is, str);
-// 	e=g.addEdge(nodes[i], nodes[j]);
-// 	capacity.update();
-// 	capacity.set(e, cap);
-// 	break;
-//       }
-//     }
-//   }