COIN-OR::LEMON - Graph Library

Changeset 579:997a75bac45a in lemon


Ignore:
Timestamp:
02/23/09 14:51:10 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Small improvements in DIMACS solver (#226)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • tools/dimacs-solver.cc

    r573 r579  
    1919///\ingroup tools
    2020///\file
    21 ///\brief DIMACS to LGF converter.
     21///\brief DIMACS problem solver.
    2222///
    23 /// This program converts various DIMACS formats to the LEMON Digraph Format
    24 /// (LGF).
     23/// This program solves various problems given in DIMACS format.
    2524///
    2625/// See
     
    121120    case DimacsDescriptor::MIN:
    122121      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";
    125123      break;
    126124    case DimacsDescriptor::MAX:
     
    142140
    143141  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;
    149142
    150143  std::string inputName;
     
    189182      std::cerr << ap.commandName() << ": too many arguments\n";
    190183      return 1;
    191   }
     184    }
    192185  std::istream& is = (ap.files().size()<1 ? std::cin : input);
    193186  std::ostream& os = (ap.files().size()<2 ? std::cout : output);
     
    217210      std::cout << "\nNum of nodes: " << desc.nodeNum;
    218211      std::cout << "\nNum of arcs:  " << desc.edgeNum;
    219       std::cout << '\n' << std::endl;
     212      std::cout << "\n\n";
    220213    }
    221214   
Note: See TracChangeset for help on using the changeset viewer.