Changeset 210:81cfc04531e8 in lemon1.0 for doc/groups.dox
 Timestamp:
 07/13/08 21:09:47 (14 years ago)
 Branch:
 default
 Children:
 211:542dd614cbb4, 212:1ae84dea7d09, 214:60eecd3fe37a, 216:6d7bfcf5b48e
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r209 r210 228 228 229 229 \f[ 0 \le f_a \le c_a \f] 230 \f[ \sum_{v\in\delta^{}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv} \qquad \forall u \in V \setminus \{s,t\}\f] 230 \f[ \sum_{v\in\delta^{}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv} 231 \qquad \forall u \in V \setminus \{s,t\}\f] 231 232 \f[ \max \sum_{v\in\delta^{+}(s)}f_{uv}  \sum_{v\in\delta^{}(s)}f_{vu}\f] 232 233 … … 268 269 cut is the \f$X\f$ solution of the next optimization problem: 269 270 270 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f] 271 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}} 272 \sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f] 271 273 272 274 LEMON contains several algorithms related to minimum cut problems: … … 301 303 \brief Algorithms for planarity checking, embedding and drawing 302 304 303 This group describes the algorithms for planarity checking, embedding and drawing. 305 This group describes the algorithms for planarity checking, 306 embedding and drawing. 304 307 305 308 \image html planar.png … … 478 481 \brief Reading and writing \ref lgfformat "Lemon Graph Format". 479 482 480 This group describes methods for reading and writing \ref lgfformat "Lemon Graph Format". 483 This group describes methods for reading and writing 484 \ref lgfformat "Lemon Graph Format". 481 485 */ 482 486
Note: See TracChangeset
for help on using the changeset viewer.