# Changeset 210:81cfc04531e8 in lemon for doc

Ignore:
Timestamp:
07/13/08 21:09:47 (15 years ago)
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:
2 edited

### Legend:

Unmodified
 r209 \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] 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: \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 \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". */