COIN-OR::LEMON - Graph Library

Changeset 1280:fbdde70389da in lemon for doc


Ignore:
Timestamp:
08/09/13 18:56:00 (6 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
1.3
Phase:
public
Message:

Trim the documentation

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1271 r1280  
    295295
    296296/**
    297 @defgroup matrices Matrices
    298 @ingroup auxdat
    299 \brief Two dimensional data storages implemented in LEMON.
    300 
    301 This group contains two dimensional data storages implemented in LEMON.
    302 */
    303 
    304 /**
    305297@defgroup algs Algorithms
    306298\brief This group contains the several algorithms
     
    335327   but the digraph should not contain directed cycles with negative total
    336328   length.
    337  - \ref FloydWarshall "Floyd-Warshall" and \ref Johnson "Johnson" algorithms
    338    for solving the \e all-pairs \e shortest \e paths \e problem when arc
    339    lenghts can be either positive or negative, but the digraph should
    340    not contain directed cycles with negative total length.
    341329 - \ref Suurballe A successive shortest path algorithm for finding
    342330   arc-disjoint paths between two nodes having minimum total length.
     
    372360\f[ 0 \leq f(uv) \leq cap(uv) \quad \forall uv\in A \f]
    373361
    374 LEMON contains several algorithms for solving maximum flow problems:
    375 - \ref EdmondsKarp Edmonds-Karp algorithm
    376   \cite edmondskarp72theoretical.
    377 - \ref Preflow Goldberg-Tarjan's preflow push-relabel algorithm
    378   \cite goldberg88newapproach.
    379 - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees
    380   \cite dinic70algorithm, \cite sleator83dynamic.
    381 - \ref GoldbergTarjan !Preflow push-relabel 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 Goldberg-Tarjan's
     363preflow push-relabel algorithm \cite goldberg88newapproach for finding
     364maximum flows. It also provides functions to query the minimum cut,
     365which is the dual problem of maximum flow.
    388366
    389367\ref Circulation is a preflow push-relabel algorithm implemented directly
     
    520498
    521499The matching algorithms implemented in LEMON:
    522 - \ref MaxBipartiteMatching Hopcroft-Karp augmenting path algorithm
    523   for calculating maximum cardinality matching in bipartite graphs.
    524 - \ref PrBipartiteMatching Push-relabel algorithm
    525   for calculating maximum cardinality matching in bipartite graphs.
    526 - \ref MaxWeightedBipartiteMatching
    527   Successive shortest path algorithm for calculating maximum weighted
    528   matching and maximum weighted bipartite matching in bipartite graphs.
    529 - \ref MinCostMaxBipartiteMatching
    530   Successive shortest path algorithm for calculating minimum cost maximum
    531   matching in bipartite graphs.
    532500- \ref MaxMatching Edmond's blossom shrinking algorithm for calculating
    533501  maximum cardinality matching in general graphs.
     
    654622
    655623/**
    656 @defgroup lp_utils Tools for Lp and Mip Solvers
    657 @ingroup lp_group
    658 \brief Helper tools to the Lp and Mip solvers.
    659 
    660 This group adds some helper tools to general optimization framework
    661 implemented in LEMON.
    662 */
    663 
    664 /**
    665 @defgroup metah Metaheuristics
    666 @ingroup gen_opt_group
    667 \brief Metaheuristics for LEMON library.
    668 
    669 This group contains some metaheuristic optimization tools.
    670 */
    671 
    672 /**
    673624@defgroup utils Tools and Utilities
    674625\brief Tools and utilities for programming in LEMON
Note: See TracChangeset for help on using the changeset viewer.