diff -r 9f529abcaebf -r 4ac30454f1c1 doc/groups.dox
--- a/doc/groups.dox	Thu Jun 11 23:13:24 2009 +0200
+++ b/doc/groups.dox	Fri Jul 24 10:27:40 2009 +0200
@@ -375,7 +375,7 @@
 cut is the \f$X\f$ solution of the next optimization problem:
 
 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}
-    \sum_{uv\in A, u\in X, v\not\in X}cap(uv) \f]
+    \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f]
 
 LEMON contains several algorithms related to minimum cut problems:
 
@@ -398,8 +398,8 @@
 This group contains the algorithms for discovering the graph properties
 like connectivity, bipartiteness, euler property, simplicity etc.
 
-\image html edge_biconnected_components.png
-\image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
+\image html connected_components.png
+\image latex connected_components.eps "Connected components" width=\textwidth
 */
 
 /**