COIN-OR::LEMON - Graph Library

Changeset 1973:30c97275f337 in lemon-0.x for lemon


Ignore:
Timestamp:
02/20/06 07:43:08 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2557
Message:

Spellchecking

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/minimum_cut.h

    r1968 r1973  
    155155  /// This class provides an efficient implementation of Maximum Cardinality
    156156  /// Search algorithm. The maximum cardinality search chooses first time any
    157   /// node of the graph. Then every time chooses that node which connected
     157  /// node of the graph. Then every time it chooses the node which is connected
    158158  /// to the processed nodes at most in the sum of capacities on the out
    159159  /// edges. If there is a cut in the graph the algorithm should choose
    160   /// again any unprocessed node of the graph. Each nodes cardinality is
     160  /// again any unprocessed node of the graph. Each node cardinality is
    161161  /// the sum of capacities on the out edges to the nodes which are processed
    162162  /// before the given node.
     
    13051305    /// It sets the nodes of one of the two partitions to true in
    13061306    /// the given BoolNodeMap. The map contains a valid cut if the
    1307     /// map have been setted false previously.
     1307    /// map have been set false previously.
    13081308    template <typename NodeMap>
    13091309    Value quickMinCut(NodeMap& nodeMap) const {
     
    13321332    /// \brief Returns a minimum cut in an EdgeMap.
    13331333    ///
    1334     /// If an undirected edge is cut edge then it will be
    1335     /// setted to true and the others will be setted to false in the given map.
     1334    /// If an undirected edge is in a minimum cut then it will be
     1335    /// set to true and the others will be set to false in the given map.
    13361336    template <typename EdgeMap>
    13371337    Value cutEdges(EdgeMap& edgeMap) const {
Note: See TracChangeset for help on using the changeset viewer.