COIN-OR::LEMON - Graph Library

Changeset 903:2e664d4969d7 in lemon-0.x


Ignore:
Timestamp:
09/22/04 14:33:30 (15 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/dimacs.h

    r784 r903  
    186186  }
    187187
    188 
    189188  /// @}
    190189
     
    192191
    193192#endif //HUGO_DIMACS_H
    194 
    195 //  template<typename Graph, typename CapacityMap>
    196 //   void readDimacsMaxFlow(std::istream& is, Graph &g,
    197 //                       typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) {
    198 //     g.clear();
    199 //     int cap;
    200 //     char d;
    201 //     std::string problem;
    202 //     char c;
    203 //     int i, j;
    204 //     std::string str;
    205 //     int n, m;
    206 //     typename Graph::Edge e;
    207 //     std::vector<typename Graph::Node> nodes;
    208 //     while (is>>c) {
    209 //       switch (c) {
    210 //       case 'c': //comment
    211 //      getline(is, str);
    212 //      break;
    213 //       case 'p': //problem definition
    214 //      is >> problem >> n >> m;
    215 //      getline(is, str);
    216 //      nodes.resize(n+1);
    217 //      for (int k=1; k<=n; ++k) nodes[k]=g.addNode();
    218 //      break;
    219 //       case 'n': //node definition
    220 //      if (problem=="sp") { //shortest path problem
    221 //        is >> i;
    222 //        getline(is, str);
    223 //        s=nodes[i];
    224 //      }
    225 //      if (problem=="max") { //max flow problem
    226 //        is >> i >> d;
    227 //        getline(is, str);
    228 //        if (d=='s') s=nodes[i];
    229 //        if (d=='t') t=nodes[i];
    230 //      }
    231 //      break;
    232 //       case 'a':
    233 //      is >> i >> j >> cap;
    234 //      getline(is, str);
    235 //      e=g.addEdge(nodes[i], nodes[j]);
    236 //      capacity.update();
    237 //      capacity.set(e, cap);
    238 //      break;
    239 //       }
    240 //     }
    241 //   }
Note: See TracChangeset for help on using the changeset viewer.