Changeset 1280:fbdde70389da in lemon for doc
 Timestamp:
 08/09/13 18:56:00 (7 years ago)
 Branch:
 1.3
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r1271 r1280 295 295 296 296 /** 297 @defgroup matrices Matrices298 @ingroup auxdat299 \brief Two dimensional data storages implemented in LEMON.300 301 This group contains two dimensional data storages implemented in LEMON.302 */303 304 /**305 297 @defgroup algs Algorithms 306 298 \brief This group contains the several algorithms … … 335 327 but the digraph should not contain directed cycles with negative total 336 328 length. 337  \ref FloydWarshall "FloydWarshall" and \ref Johnson "Johnson" algorithms338 for solving the \e allpairs \e shortest \e paths \e problem when arc339 lenghts can be either positive or negative, but the digraph should340 not contain directed cycles with negative total length.341 329  \ref Suurballe A successive shortest path algorithm for finding 342 330 arcdisjoint paths between two nodes having minimum total length. … … 372 360 \f[ 0 \leq f(uv) \leq cap(uv) \quad \forall uv\in A \f] 373 361 374 LEMON contains several algorithms for solving maximum flow problems: 375  \ref EdmondsKarp EdmondsKarp algorithm 376 \cite edmondskarp72theoretical. 377  \ref Preflow GoldbergTarjan's preflow pushrelabel algorithm 378 \cite goldberg88newapproach. 379  \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees 380 \cite dinic70algorithm, \cite sleator83dynamic. 381  \ref GoldbergTarjan !Preflow pushrelabel algorithm with dynamic trees 382 \cite goldberg88newapproach, \cite sleator83dynamic. 383 384 In most cases the \ref Preflow algorithm provides the 385 fastest method for computing a maximum flow. All implementations 386 also provide functions to query the minimum cut, which is the dual 387 problem of maximum flow. 362 \ref Preflow is an efficient implementation of GoldbergTarjan's 363 preflow pushrelabel algorithm \cite goldberg88newapproach for finding 364 maximum flows. It also provides functions to query the minimum cut, 365 which is the dual problem of maximum flow. 388 366 389 367 \ref Circulation is a preflow pushrelabel algorithm implemented directly … … 520 498 521 499 The matching algorithms implemented in LEMON: 522  \ref MaxBipartiteMatching HopcroftKarp augmenting path algorithm523 for calculating maximum cardinality matching in bipartite graphs.524  \ref PrBipartiteMatching Pushrelabel algorithm525 for calculating maximum cardinality matching in bipartite graphs.526  \ref MaxWeightedBipartiteMatching527 Successive shortest path algorithm for calculating maximum weighted528 matching and maximum weighted bipartite matching in bipartite graphs.529  \ref MinCostMaxBipartiteMatching530 Successive shortest path algorithm for calculating minimum cost maximum531 matching in bipartite graphs.532 500  \ref MaxMatching Edmond's blossom shrinking algorithm for calculating 533 501 maximum cardinality matching in general graphs. … … 654 622 655 623 /** 656 @defgroup lp_utils Tools for Lp and Mip Solvers657 @ingroup lp_group658 \brief Helper tools to the Lp and Mip solvers.659 660 This group adds some helper tools to general optimization framework661 implemented in LEMON.662 */663 664 /**665 @defgroup metah Metaheuristics666 @ingroup gen_opt_group667 \brief Metaheuristics for LEMON library.668 669 This group contains some metaheuristic optimization tools.670 */671 672 /**673 624 @defgroup utils Tools and Utilities 674 625 \brief Tools and utilities for programming in LEMON
Note: See TracChangeset
for help on using the changeset viewer.