Changeset 532:997a75bac45a in lemon-1.2 for tools

Timestamp:

02/23/09 14:51:10 (16 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Small improvements in DIMACS solver (#226)

File:

• tools/dimacs-solver.cc (modified) (5 diffs)

tools/dimacs-solver.cc

@@ -19 +19 @@
 ///\ingroup tools
 ///\file
-///\brief DIMACS to LGF converter.
+///\brief DIMACS problem solver.
 ///
-/// This program converts various DIMACS formats to the LEMON Digraph Format
-/// (LGF).
+/// This program solves various problems given in DIMACS format.
 ///
 /// See
@@ -121 +120 @@
     case DimacsDescriptor::MIN:
       std::cerr <<
-        "\n\n Sorry, the min. cost flow solver is not yet available.\n"
-                << std::endl;
+        "\n\n Sorry, the min. cost flow solver is not yet available.\n";
       break;
     case DimacsDescriptor::MAX:
@@ -142 +140 @@
 
   typedef Digraph::Arc Arc;
-  typedef Digraph::Node Node;
-  typedef Digraph::ArcIt ArcIt;
-  typedef Digraph::NodeIt NodeIt;
-  typedef Digraph::ArcMap<double> DoubleArcMap;
-  typedef Digraph::NodeMap<double> DoubleNodeMap;
 
   std::string inputName;
@@ -189 +182 @@
       std::cerr << ap.commandName() << ": too many arguments\n";
       return 1;
-  }
+    }
   std::istream& is = (ap.files().size()<1 ? std::cin : input);
   std::ostream& os = (ap.files().size()<2 ? std::cout : output);
@@ -217 +210 @@
       std::cout << "\nNum of nodes: " << desc.nodeNum;
       std::cout << "\nNum of arcs:  " << desc.edgeNum;
-      std::cout << '\n' << std::endl;
+      std::cout << "\n\n";
     }