COIN-OR::LEMON - Graph Library

Changeset 427:a677104e946a in lemon-0.x


Ignore:
Timestamp:
04/26/04 19:39:15 (16 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@567
Message:

Minor doc corrections

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/include/dimacs.h

    r423 r427  
    77#include <vector>
    88
     9/// \file \brief Dimacs file format reader.
     10
    911namespace hugo {
    1012
    11   /// Dimacs flow files.
     13  /// Dimacs flow file format reader function.
    1214
    1315  /// This function reads a flow instance from dimacs flow format.
    14   /// At the beginning \c g is destroyed by \c g.clear().
    15   /// If the data coming from \c is is a max flow innstance, then
    16   /// \c s and \t will be respectively the source and target nodes
     16  /// At the beginning \c g is cleared by \c g.clear().
     17  /// If the data coming from \c is is a max flow problem instance, then
     18  /// \c s and \c t will be respectively the source and target nodes
    1719  /// and \c capacity will contain the edge capacities.
    18   /// If the data is a shortest path problem then \c s will be the
    19   /// source node and \capacity will contain the edge lengths.
     20  /// If the data is a shortest path problem instance then \c s will be the
     21  /// source node and \c capacity will contain the edge lengths.
    2022  template<typename Graph, typename CapacityMap>
    2123  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.