Changeset 961:7af2ae7c1428 in lemon
 Timestamp:
 03/18/10 00:29:35 (13 years ago)
 Branch:
 1.2
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r956 r961 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 \ref edmondskarp72theoretical. 377  \ref Preflow GoldbergTarjan's preflow pushrelabel algorithm 378 \ref goldberg88newapproach. 379  \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees 380 \ref dinic70algorithm, \ref sleator83dynamic. 381  \ref GoldbergTarjan !Preflow pushrelabel algorithm with dynamic trees 382 \ref goldberg88newapproach, \ref 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 \ref 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 … … 442 420  \ref HaoOrlin "HaoOrlin algorithm" for calculating minimum cut 443 421 in directed graphs. 444  \ref NagamochiIbaraki "NagamochiIbaraki algorithm" for445 calculating minimum cut in undirected graphs.446 422  \ref GomoryHu "GomoryHu tree computation" for calculating 447 423 allpairs minimum cut in undirected graphs. … … 506 482 507 483 The matching algorithms implemented in LEMON: 508  \ref MaxBipartiteMatching HopcroftKarp augmenting path algorithm509 for calculating maximum cardinality matching in bipartite graphs.510  \ref PrBipartiteMatching Pushrelabel algorithm511 for calculating maximum cardinality matching in bipartite graphs.512  \ref MaxWeightedBipartiteMatching513 Successive shortest path algorithm for calculating maximum weighted514 matching and maximum weighted bipartite matching in bipartite graphs.515  \ref MinCostMaxBipartiteMatching516 Successive shortest path algorithm for calculating minimum cost maximum517 matching in bipartite graphs.518 484  \ref MaxMatching Edmond's blossom shrinking algorithm for calculating 519 485 maximum cardinality matching in general graphs. … … 560 526 561 527 /** 562 @defgroup approx Approximation Algorithms563 @ingroup algs564 \brief Approximation algorithms.565 566 This group contains the approximation and heuristic algorithms567 implemented in LEMON.568 */569 570 /**571 528 @defgroup auxalg Auxiliary Algorithms 572 529 @ingroup algs … … 597 554 The currently supported solvers are \ref glpk, \ref clp, \ref cbc, 598 555 \ref cplex, \ref soplex. 599 */600 601 /**602 @defgroup lp_utils Tools for Lp and Mip Solvers603 @ingroup lp_group604 \brief Helper tools to the Lp and Mip solvers.605 606 This group adds some helper tools to general optimization framework607 implemented in LEMON.608 */609 610 /**611 @defgroup metah Metaheuristics612 @ingroup gen_opt_group613 \brief Metaheuristics for LEMON library.614 615 This group contains some metaheuristic optimization tools.616 556 */ 617 557
Note: See TracChangeset
for help on using the changeset viewer.