Changes in tools/dimacssolver.cc [532:997a75bac45a:526:28b154307c0d] in lemon1.2
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

tools/dimacssolver.cc
r532 r526 19 19 ///\ingroup tools 20 20 ///\file 21 ///\brief DIMACS problem solver.21 ///\brief DIMACS to LGF converter. 22 22 /// 23 /// This program solves various problems given in DIMACS format. 23 /// This program converts various DIMACS formats to the LEMON Digraph Format 24 /// (LGF). 24 25 /// 25 26 /// See … … 120 121 case DimacsDescriptor::MIN: 121 122 std::cerr << 122 "\n\n Sorry, the min. cost flow solver is not yet available.\n"; 123 "\n\n Sorry, the min. cost flow solver is not yet available.\n" 124 << std::endl; 123 125 break; 124 126 case DimacsDescriptor::MAX: … … 140 142 141 143 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; 142 149 143 150 std::string inputName; … … 182 189 std::cerr << ap.commandName() << ": too many arguments\n"; 183 190 return 1; 184 191 } 185 192 std::istream& is = (ap.files().size()<1 ? std::cin : input); 186 193 std::ostream& os = (ap.files().size()<2 ? std::cout : output); … … 210 217 std::cout << "\nNum of nodes: " << desc.nodeNum; 211 218 std::cout << "\nNum of arcs: " << desc.edgeNum; 212 std::cout << "\n\n";219 std::cout << '\n' << std::endl; 213 220 } 214 221
Note: See TracChangeset
for help on using the changeset viewer.