1.1 --- a/doc/groups.dox Thu Jun 11 23:13:24 2009 +0200
1.2 +++ b/doc/groups.dox Fri Jul 24 10:27:40 2009 +0200
1.3 @@ -375,7 +375,7 @@
1.4 cut is the \f$X\f$ solution of the next optimization problem:
1.5
1.6 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}
1.7 - \sum_{uv\in A, u\in X, v\not\in X}cap(uv) \f]
1.8 + \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f]
1.9
1.10 LEMON contains several algorithms related to minimum cut problems:
1.11
1.12 @@ -398,8 +398,8 @@
1.13 This group contains the algorithms for discovering the graph properties
1.14 like connectivity, bipartiteness, euler property, simplicity etc.
1.15
1.16 -\image html edge_biconnected_components.png
1.17 -\image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
1.18 +\image html connected_components.png
1.19 +\image latex connected_components.eps "Connected components" width=\textwidth
1.20 */
1.21
1.22 /**