COIN-OR::LEMON - Graph Library

Changeset 713:4ac30454f1c1 in lemon-1.2 for doc/groups.dox


Ignore:
Timestamp:
07/24/09 10:27:40 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Small doc improvements

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r663 r713  
    376376
    377377\f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}
    378     \sum_{uv\in A, u\in X, v\not\in X}cap(uv) \f]
     378    \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f]
    379379
    380380LEMON contains several algorithms related to minimum cut problems:
     
    399399like connectivity, bipartiteness, euler property, simplicity etc.
    400400
    401 \image html edge_biconnected_components.png
    402 \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
     401\image html connected_components.png
     402\image latex connected_components.eps "Connected components" width=\textwidth
    403403*/
    404404
Note: See TracChangeset for help on using the changeset viewer.