Changeset 2530:f86f7e4eb2ba in lemon0.x for doc/groups.dox
 Timestamp:
 12/04/07 11:55:27 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3407
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r2514 r2530 259 259 260 260 /** 261 @defgroup min_cut Minimum Cut algorithms 262 @ingroup algs 263 \brief This group describes the algorithms 264 for finding minimum cut in graphs. 265 266 This group describes the algorithms 267 for finding minimum cut in graphs. 261 @defgroup min_cut Minimum Cut algorithms 262 @ingroup algs 263 264 \brief This group describes the algorithms for finding minimum cut in 265 graphs. 266 267 This group describes the algorithms for finding minimum cut in graphs. 268 269 The minimum cut problem is to find a nonempty and noncomplete 270 \f$X\f$ subset of the vertices with minimum overall capacity on 271 outgoing arcs. Formally, there is \f$G=(V,A)\f$ directed graph, an 272 \f$c_a:A\rightarrow\mathbf{R}^+_0\f$ capacity function. The minimum 273 cut is the solution of the next optimization problem: 274 275 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f] 276 277 The lemon contains several algorithms related to minimum cut problems: 278 279  \ref lemon::HaoOrlin "HaoOrlin algorithm" for calculate minimum cut 280 in directed graphs 281  \ref lemon::NagamochiIbaraki "NagamochiIbaraki algorithm" for 282 calculate minimum cut in undirected graphs 283  \ref lemon::GomoryHuTree "GomoryHu tree computation" for calculate all 284 pairs minimum cut in undirected graphs 285 286 If you want to find minimum cut just between two distinict nodes, 287 please see the \ref max_flow "Maximum Flow page". 288 268 289 */ 269 290
Note: See TracChangeset
for help on using the changeset viewer.