Changeset 532:997a75bac45a in lemon1.2 for tools/dimacssolver.cc
 Timestamp:
 02/23/09 14:51:10 (11 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

tools/dimacssolver.cc
r526 r532 19 19 ///\ingroup tools 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 /// 26 25 /// See … … 121 120 case DimacsDescriptor::MIN: 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; 126 124 case DimacsDescriptor::MAX: … … 142 140 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 150 143 std::string inputName; … … 189 182 std::cerr << ap.commandName() << ": too many arguments\n"; 190 183 return 1; 191 }184 } 192 185 std::istream& is = (ap.files().size()<1 ? std::cin : input); 193 186 std::ostream& os = (ap.files().size()<2 ? std::cout : output); … … 217 210 std::cout << "\nNum of nodes: " << desc.nodeNum; 218 211 std::cout << "\nNum of arcs: " << desc.edgeNum; 219 std::cout << '\n' << std::endl;212 std::cout << "\n\n"; 220 213 } 221 214
Note: See TracChangeset
for help on using the changeset viewer.