COIN-OR::LEMON - Graph Library

Changeset 1285:bf1840562c67 in lemon-0.x


Ignore:
Timestamp:
04/01/05 10:16:35 (15 years ago)
Author:
zsuzska
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1717
Message:

corrections in docs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/preflow.h

    r1227 r1285  
    4343  ///edges should be passed to the algorithm through the
    4444  ///constructor. It is possible to change these quantities using the
    45   ///functions \ref source, \ref target, \ref setCap and \ref
    46   ///setFlow.
     45  ///functions \ref source, \ref target, \ref capacityMap and \ref
     46  ///flowMap.
    4747  ///
    4848  ///After running \ref lemon::Preflow::phase1() "phase1()"
     
    135135
    136136    ///The constructor of the class.
    137     ///\param _G The directed graph the algorithm runs on.
     137    ///\param _gr The directed graph the algorithm runs on.
    138138    ///\param _s The source node.
    139139    ///\param _t The target node.
     
    141141    ///\param _f The flow of the edges.
    142142    ///Except the graph, all of these parameters can be reset by
    143     ///calling \ref source, \ref target, \ref setCap and \ref
    144     ///setFlow, resp.
     143    ///calling \ref source, \ref target, \ref capacityMap and \ref
     144    ///flowMap, resp.
    145145      Preflow(const Graph& _gr, Node _s, Node _t,
    146146              const CapacityMap& _cap, FlowMap& _f) :
     
    179179    ///The preflow algorithm consists of two phases, this method runs
    180180    ///the first phase. After the first phase the maximum flow value
    181     ///and a minimum value cut can already be computed, though a
     181    ///and a minimum value cut can already be computed, although a
    182182    ///maximum flow is not yet obtained. So after calling this method
    183183    ///\ref flowValue returns the value of a maximum flow and \ref
     
    201201    ///The preflow algorithm consists of two phases, this method runs
    202202    ///the first phase. After the first phase the maximum flow value
    203     ///and a minimum value cut can already be computed, though a
     203    ///and a minimum value cut can already be computed, although a
    204204    ///maximum flow is not yet obtained. So after calling this method
    205205    ///\ref flowValue returns the value of a maximum flow and \ref
     
    515515      status=AFTER_NOTHING;
    516516    }
    517     /// Returns a reference to to capacity map.
    518 
    519     /// Returns a reference to to capacity map.
     517    /// Returns a reference to capacity map.
     518
     519    /// Returns a reference to capacity map.
    520520    ///
    521521    const CapacityMap &capacityMap() const {
     
    533533    }
    534534     
    535     /// Returns a reference to to flow map.
    536 
    537     /// Returns a reference to to flow map.
     535    /// Returns a reference to flow map.
     536
     537    /// Returns a reference to flow map.
    538538    ///
    539539    const FlowMap &flowMap() const {
Note: See TracChangeset for help on using the changeset viewer.