COIN-OR::LEMON - Graph Library

Changeset 682:1ea8162ce638 in lemon-0.x for src/work/jacint


Ignore:
Timestamp:
06/14/04 11:47:54 (17 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@930
Message:

doc

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/jacint/max_matching.h

    r586 r682  
    2626  ///\ref writeNMapNode, \ref writeNMapEdge or \ref writeEMapBool
    2727  ///depending on the preferred container.
    28 
     28  ///
    2929  ///The dual side of a mathcing is a map of the nodes to
    3030  ///MaxMatching::pos_enum, having values D, A and C showing the
     
    3535  ///writePos after running the algorithm. Before subsequent runs,
    3636  ///the function \ref resetPos() must be called.
    37 
     37  ///
    3838  ///\param Graph The undirected graph type the algorithm runs on.
    39 
     39  ///
    4040  ///\author Jacint Szabo 
    4141  template <typename Graph>
     
    240240    ///After calling any run methods of the class, and before calling
    241241    ///\ref resetPos(), it writes the Gallai-Edmonds canonical
    242     ///decomposition of the graph. \c map must be a node map of \ref pos_enum 's.
     242    ///decomposition of the graph. \c map must be a node map
     243    ///of \ref pos_enum 's.
    243244    template<typename NMapEnum>
    244245    void writePos (NMapEnum& map) const {
Note: See TracChangeset for help on using the changeset viewer.