# Changeset 1280:fbdde70389da in lemon for doc/groups.dox

Ignore:
Timestamp:
08/09/13 18:56:00 (8 years ago)
Branch:
1.3
Phase:
public
Message:

Trim the documentation

File:
1 edited

Unmodified
Removed
• ## doc/groups.dox

 r1271 /** @defgroup matrices Matrices @ingroup auxdat \brief Two dimensional data storages implemented in LEMON. This group contains two dimensional data storages implemented in LEMON. */ /** @defgroup algs Algorithms \brief This group contains the several algorithms but the digraph should not contain directed cycles with negative total length. - \ref FloydWarshall "Floyd-Warshall" and \ref Johnson "Johnson" algorithms for solving the \e all-pairs \e shortest \e paths \e problem when arc lenghts can be either positive or negative, but the digraph should not contain directed cycles with negative total length. - \ref Suurballe A successive shortest path algorithm for finding arc-disjoint paths between two nodes having minimum total length. \f[ 0 \leq f(uv) \leq cap(uv) \quad \forall uv\in A \f] LEMON contains several algorithms for solving maximum flow problems: - \ref EdmondsKarp Edmonds-Karp algorithm \cite edmondskarp72theoretical. - \ref Preflow Goldberg-Tarjan's preflow push-relabel algorithm \cite goldberg88newapproach. - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees \cite dinic70algorithm, \cite sleator83dynamic. - \ref GoldbergTarjan !Preflow push-relabel algorithm with dynamic trees \cite goldberg88newapproach, \cite sleator83dynamic. In most cases the \ref Preflow algorithm provides the fastest method for computing a maximum flow. All implementations also provide functions to query the minimum cut, which is the dual problem of maximum flow. \ref Preflow is an efficient implementation of Goldberg-Tarjan's preflow push-relabel algorithm \cite goldberg88newapproach for finding maximum flows. It also provides functions to query the minimum cut, which is the dual problem of maximum flow. \ref Circulation is a preflow push-relabel algorithm implemented directly The matching algorithms implemented in LEMON: - \ref MaxBipartiteMatching Hopcroft-Karp augmenting path algorithm for calculating maximum cardinality matching in bipartite graphs. - \ref PrBipartiteMatching Push-relabel algorithm for calculating maximum cardinality matching in bipartite graphs. - \ref MaxWeightedBipartiteMatching Successive shortest path algorithm for calculating maximum weighted matching and maximum weighted bipartite matching in bipartite graphs. - \ref MinCostMaxBipartiteMatching Successive shortest path algorithm for calculating minimum cost maximum matching in bipartite graphs. - \ref MaxMatching Edmond's blossom shrinking algorithm for calculating maximum cardinality matching in general graphs. /** @defgroup lp_utils Tools for Lp and Mip Solvers @ingroup lp_group \brief Helper tools to the Lp and Mip solvers. This group adds some helper tools to general optimization framework implemented in LEMON. */ /** @defgroup metah Metaheuristics @ingroup gen_opt_group \brief Metaheuristics for LEMON library. This group contains some metaheuristic optimization tools. */ /** @defgroup utils Tools and Utilities \brief Tools and utilities for programming in LEMON
Note: See TracChangeset for help on using the changeset viewer.