Changeset 903:2e664d4969d7 in lemon-0.x

Timestamp:

09/22/04 14:33:30 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1211

Message:

Some commenticide was applied.

File:

• src/hugo/dimacs.h (modified) (2 diffs)

src/hugo/dimacs.h

@@ -186 +186 @@
   }
 
-
   /// @}
 
@@ -192 +191 @@
 
 #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;
-//       }
-//     }
-//   }