gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Small improvements in DIMACS solver (#226)
0 1 0
default
1 file changed with 5 insertions and 12 deletions:
↑ Collapse diff ↑
Show white space 6 line context
... ...
@@ -20,6 +20,5 @@
20 20
///\file
21
///\brief DIMACS to LGF converter.
21
///\brief DIMACS problem solver.
22 22
///
23
/// This program converts various DIMACS formats to the LEMON Digraph Format
24
/// (LGF).
23
/// This program solves various problems given in DIMACS format.
25 24
///
... ...
@@ -122,4 +121,3 @@
122 121
      std::cerr <<
123
        "\n\n Sorry, the min. cost flow solver is not yet available.\n"
124
                << std::endl;
122
        "\n\n Sorry, the min. cost flow solver is not yet available.\n";
125 123
      break;
... ...
@@ -143,7 +141,2 @@
143 141
  typedef Digraph::Arc Arc;
144
  typedef Digraph::Node Node;
145
  typedef Digraph::ArcIt ArcIt;
146
  typedef Digraph::NodeIt NodeIt;
147
  typedef Digraph::ArcMap<double> DoubleArcMap;
148
  typedef Digraph::NodeMap<double> DoubleNodeMap;
149 142

	
... ...
@@ -190,3 +183,3 @@
190 183
      return 1;
191
  }
184
    }
192 185
  std::istream& is = (ap.files().size()<1 ? std::cin : input);
... ...
@@ -218,3 +211,3 @@
218 211
      std::cout << "\nNum of arcs:  " << desc.edgeNum;
219
      std::cout << '\n' << std::endl;
212
      std::cout << "\n\n";
220 213
    }
0 comments (0 inline)