1.1 --- a/doc/groups.dox	Sun Jul 13 19:51:02 2008 +0100
     1.2 +++ b/doc/groups.dox	Sun Jul 13 20:09:47 2008 +0100
     1.3 @@ -227,7 +227,8 @@
     1.4  maximum flow is the \f$f_a\f$ solution of the next optimization problem:
     1.5  
     1.6  \f[ 0 \le f_a \le c_a \f]
     1.7 -\f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv} \qquad \forall u \in V \setminus \{s,t\}\f]
     1.8 +\f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv}
     1.9 +\qquad \forall u \in V \setminus \{s,t\}\f]
    1.10  \f[ \max \sum_{v\in\delta^{+}(s)}f_{uv} - \sum_{v\in\delta^{-}(s)}f_{vu}\f]
    1.11  
    1.12  LEMON contains several algorithms for solving maximum flow problems:
    1.13 @@ -267,7 +268,8 @@
    1.14  \f$c_a:A\rightarrow\mathbf{R}^+_0\f$ capacity function. The minimum
    1.15  cut is the \f$X\f$ solution of the next optimization problem:
    1.16  
    1.17 -\f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f]
    1.18 +\f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}
    1.19 +\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f]
    1.20  
    1.21  LEMON contains several algorithms related to minimum cut problems:
    1.22  
    1.23 @@ -300,7 +302,8 @@
    1.24  @ingroup algs
    1.25  \brief Algorithms for planarity checking, embedding and drawing
    1.26  
    1.27 -This group describes the algorithms for planarity checking, embedding and drawing.
    1.28 +This group describes the algorithms for planarity checking,
    1.29 +embedding and drawing.
    1.30  
    1.31  \image html planar.png
    1.32  \image latex planar.eps "Plane graph" width=\textwidth
    1.33 @@ -477,7 +480,8 @@
    1.34  @ingroup io_group
    1.35  \brief Reading and writing \ref lgf-format "Lemon Graph Format".
    1.36  
    1.37 -This group describes methods for reading and writing \ref lgf-format "Lemon Graph Format".
    1.38 +This group describes methods for reading and writing
    1.39 +\ref lgf-format "Lemon Graph Format".
    1.40  */
    1.41  
    1.42  /**