COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/08/04 18:04:28 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@763
Message:

doc

File:
1 edited

Legend:

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

    r582 r586  
    5555    ///Indicates the Gallai-Edmonds decomposition of the graph, which
    5656    ///shows an upper bound on the size of a maximum matching. The
    57     ///nodes with pos_enum D induce a graph with factor-critical
    58     ///components, the nodes in A form the canonical barrier, and the
    59     ///nodes in C induce a graph having a perfect matching.
     57    ///nodes with pos_enum \c D induce a graph with factor-critical
     58    ///components, the nodes in \c A form the canonical barrier, and the
     59    ///nodes in \c C induce a graph having a perfect matching.
    6060    enum pos_enum {
    6161      D=0,
Note: See TracChangeset for help on using the changeset viewer.