COIN-OR::LEMON - Graph Library

Changeset 465:d72e56f1730d in lemon-0.x for src/include/dimacs.h


Ignore:
Timestamp:
04/29/04 11:08:14 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@616
Message:

mods implied by preflow mods

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/include/dimacs.h

    r442 r465  
    2121  /// If the data is a shortest path problem instance then \c s will be the
    2222  /// source node and \c capacity will contain the edge lengths.
     23  ///
     24  ///\author Marton Makai
    2325  template<typename Graph, typename CapacityMap>
    2426  void readDimacsMaxFlow(std::istream& is, Graph &g, typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) {
Note: See TracChangeset for help on using the changeset viewer.