COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • tools/dimacs-solver.cc

    r532 r526  
    1919///\ingroup tools
    2020///\file
    21 ///\brief DIMACS problem solver.
     21///\brief DIMACS to LGF converter.
    2222///
    23 /// This program solves various problems given in DIMACS format.
     23/// This program converts various DIMACS formats to the LEMON Digraph Format
     24/// (LGF).
    2425///
    2526/// See
     
    120121    case DimacsDescriptor::MIN:
    121122      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;
    123125      break;
    124126    case DimacsDescriptor::MAX:
     
    140142
    141143  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;
    142149
    143150  std::string inputName;
     
    182189      std::cerr << ap.commandName() << ": too many arguments\n";
    183190      return 1;
    184     }
     191  }
    185192  std::istream& is = (ap.files().size()<1 ? std::cin : input);
    186193  std::ostream& os = (ap.files().size()<2 ? std::cout : output);
     
    210217      std::cout << "\nNum of nodes: " << desc.nodeNum;
    211218      std::cout << "\nNum of arcs:  " << desc.edgeNum;
    212       std::cout << "\n\n";
     219      std::cout << '\n' << std::endl;
    213220    }
    214221   
Note: See TracChangeset for help on using the changeset viewer.