COIN-OR::LEMON - Graph Library

Changeset 425:cace3206223b in lemon-1.2 for lemon


Ignore:
Timestamp:
12/08/08 11:06:39 (11 years ago)
Author:
Balazs Dezso <deba@…>
Branch:
default
Phase:
public
Message:

Fix typos (ticket #192)

Location:
lemon
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • lemon/connectivity.h

    r419 r425  
    296296  /// direction.
    297297  ///
    298   /// \param graph The graph.
     298  /// \param digraph The graph.
    299299  /// \return The number of components
    300300  /// \note By definition, the empty graph has zero
     
    12261226  /// that the given graph is DAG.
    12271227  ///
    1228   /// \param graph The graph. It must be directed and acyclic.
     1228  /// \param digraph The graph. It must be directed and acyclic.
    12291229  /// \retval order A readable - writable node map. The values will be set
    12301230  /// from 0 to the number of the nodes in the graph minus one. Each values
  • lemon/max_matching.h

    r330 r425  
    417417    /// \ref init(), \ref greedyInit() or \ref matchingInit()
    418418    /// functions first, then you can start the algorithm with the \ref
    419     /// startParse() or startDense() functions.
     419    /// startSparse() or startDense() functions.
    420420
    421421    ///@{
  • lemon/suurballe.h

    r346 r425  
    5252  ///
    5353  /// \note For finding node-disjoint paths this algorithm can be used
    54   /// with \ref SplitDigraphAdaptor.
     54  /// with \ref SplitNodes.
    5555#ifdef DOXYGEN
    5656  template <typename Digraph, typename LengthMap>
Note: See TracChangeset for help on using the changeset viewer.