Changeset 210:81cfc04531e8 in lemon-main for doc

Timestamp:

07/13/08 21:09:47 (16 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

211:542dd614cbb4, 212:1ae84dea7d09, 214:60eecd3fe37a, 216:6d7bfcf5b48e

Phase:

public

Message:

Remove long lines (from all but one file)

Location:

doc

Files:

• coding_style.dox (modified) (1 diff)
• groups.dox (modified) (4 diffs)

doc/coding_style.dox

@@ -90 +90 @@
 \subsection cs-loc-var Class and instance member variables, auto variables
 
-The names of class and instance member variables and auto variables (=variables used locally in methods) should look like the following.
+The names of class and instance member variables and auto variables
+(=variables used locally in methods) should look like the following.
 
 \code

doc/groups.dox

@@ -228 +228 @@
 
 \f[ 0 \le f_a \le c_a \f]
-\f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv} \qquad \forall u \in V \setminus \{s,t\}\f]
+\f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv}
+\qquad \forall u \in V \setminus \{s,t\}\f]
 \f[ \max \sum_{v\in\delta^{+}(s)}f_{uv} - \sum_{v\in\delta^{-}(s)}f_{vu}\f]
 
@@ -268 +269 @@
 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}c_{uv}\f]
+\f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}
+\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f]
 
 LEMON contains several algorithms related to minimum cut problems:
@@ -301 +303 @@
 \brief Algorithms for planarity checking, embedding and drawing
 
-This group describes the algorithms for planarity checking, embedding and drawing.
+This group describes the algorithms for planarity checking,
+embedding and drawing.
 
 \image html planar.png
@@ -478 +481 @@
 \brief Reading and writing \ref lgf-format "Lemon Graph Format".
 
-This group describes methods for reading and writing \ref lgf-format "Lemon Graph Format".
+This group describes methods for reading and writing
+\ref lgf-format "Lemon Graph Format".
 */