# Changes in /[762:ece80147fb08:759:6d5f547e5bfb] in lemon

Ignore:
Files:
9 edited

Unmodified
Removed
• ## doc/groups.dox

 r762 /** @defgroup geomdat Geometric Data Structures @ingroup auxdat \brief Geometric data structures implemented in LEMON. This group contains geometric data structures implemented in LEMON. - \ref lemon::dim2::Point "dim2::Point" implements a two dimensional vector with the usual operations. - \ref lemon::dim2::Box "dim2::Box" can be used to determine the rectangular bounding box of a set of \ref lemon::dim2::Point "dim2::Point"'s. */ /** @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 /** @defgroup spantree Minimum Spanning Tree Algorithms @ingroup algs \brief Algorithms for finding minimum cost spanning trees and arborescences. This group contains the algorithms for finding minimum cost spanning trees and arborescences. */ /** @defgroup max_flow Maximum Flow Algorithms @ingroup algs \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}} \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f] \sum_{uv\in A, u\in X, v\not\in X}cap(uv) \f] LEMON contains several algorithms related to minimum cut problems: If you want to find minimum cut just between two distinict nodes, see the \ref max_flow "maximum flow problem". */ /** @defgroup graph_properties Connectivity and Other Graph Properties @ingroup algs \brief Algorithms for discovering the graph properties This group contains the algorithms for discovering the graph properties like connectivity, bipartiteness, euler property, simplicity etc. \image html edge_biconnected_components.png \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth */ /** @defgroup planar Planarity Embedding and Drawing @ingroup algs \brief Algorithms for planarity checking, embedding and drawing This group contains the algorithms for planarity checking, embedding and drawing. \image html planar.png \image latex planar.eps "Plane graph" width=\textwidth */ /** @defgroup graph_properties Connectivity and Other Graph Properties @ingroup algs \brief Algorithms for discovering the graph properties This group contains the algorithms for discovering the graph properties like connectivity, bipartiteness, euler property, simplicity etc. \image html connected_components.png \image latex connected_components.eps "Connected components" width=\textwidth */ /** @defgroup planar Planarity Embedding and Drawing @ingroup algs \brief Algorithms for planarity checking, embedding and drawing This group contains the algorithms for planarity checking, embedding and drawing. \image html planar.png \image latex planar.eps "Plane graph" width=\textwidth @defgroup spantree Minimum Spanning Tree Algorithms @ingroup algs \brief Algorithms for finding minimum cost spanning trees and arborescences. This group contains the algorithms for finding minimum cost spanning trees and arborescences. */ /** @defgroup auxalg Auxiliary Algorithms @ingroup algs \brief Auxiliary algorithms implemented in LEMON. This group contains some algorithms implemented in LEMON in order to make it easier to implement complex algorithms. */ This group contains the approximation and heuristic algorithms implemented in LEMON. */ /** @defgroup auxalg Auxiliary Algorithms @ingroup algs \brief Auxiliary algorithms implemented in LEMON. This group contains some algorithms implemented in LEMON in order to make it easier to implement complex algorithms. */ /** @defgroup dimacs_group DIMACS Format @defgroup dimacs_group DIMACS format @ingroup io_group \brief Read and write files in DIMACS format /** \anchor demoprograms @defgroup demos Demo Programs Some demo programs are listed here. Their full source codes can be found in the \c demo subdirectory of the source tree. In order to compile them, use the make demo or the make check commands. */ /** @defgroup tools Standalone Utility Applications */ /** \anchor demoprograms @defgroup demos Demo Programs Some demo programs are listed here. Their full source codes can be found in the \c demo subdirectory of the source tree. In order to compile them, use the make demo or the make check commands. */ }
• ## lemon/bfs.h

 r760 ///The simplest way to execute the BFS algorithm is to use one of the ///member functions called \ref run(Node) "run()".\n ///If you need better control on the execution, you have to call ///\ref init() first, then you can add several source nodes with ///If you need more control on the execution, first you have to call ///\ref init(), then you can add several source nodes with ///\ref addSource(). Finally the actual path computation can be ///performed with one of the \ref start() functions. /// The simplest way to execute the BFS algorithm is to use one of the /// member functions called \ref run(Node) "run()".\n /// If you need better control on the execution, you have to call /// \ref init() first, then you can add several source nodes with /// If you need more control on the execution, first you have to call /// \ref init(), then you can add several source nodes with /// \ref addSource(). Finally the actual path computation can be /// performed with one of the \ref start() functions.
• ## lemon/circulation.h

 r762 /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" /// concept. #ifdef DOXYGEN typedef GR::ArcMap FlowMap; #else typedef typename Digraph::template ArcMap FlowMap; #endif /// \brief Instantiates a FlowMap. /// The elevator type used by the algorithm. /// /// \sa Elevator, LinkedElevator #ifdef DOXYGEN typedef lemon::Elevator Elevator; #else /// \sa Elevator /// \sa LinkedElevator typedef lemon::Elevator Elevator; #endif /// \brief Instantiates an Elevator. /// \name Execution Control /// The simplest way to execute the algorithm is to call \ref run().\n /// If you need better control on the initial solution or the execution, /// you have to call one of the \ref init() functions first, then /// If you need more control on the initial solution or the execution, /// first you have to call one of the \ref init() functions, then /// the \ref start() function.
• ## lemon/dfs.h

 r760 ///The simplest way to execute the DFS algorithm is to use one of the ///member functions called \ref run(Node) "run()".\n ///If you need better control on the execution, you have to call ///\ref init() first, then you can add a source node with \ref addSource() ///If you need more control on the execution, first you have to call ///\ref init(), then you can add a source node with \ref addSource() ///and perform the actual computation with \ref start(). ///This procedure can be repeated if there are nodes that have not /// The simplest way to execute the DFS algorithm is to use one of the /// member functions called \ref run(Node) "run()".\n /// If you need better control on the execution, you have to call /// \ref init() first, then you can add a source node with \ref addSource() /// If you need more control on the execution, first you have to call /// \ref init(), then you can add a source node with \ref addSource() /// and perform the actual computation with \ref start(). /// This procedure can be repeated if there are nodes that have not
• ## lemon/dijkstra.h

 r760 ///The simplest way to execute the %Dijkstra algorithm is to use ///one of the member functions called \ref run(Node) "run()".\n ///If you need better control on the execution, you have to call ///\ref init() first, then you can add several source nodes with ///If you need more control on the execution, first you have to call ///\ref init(), then you can add several source nodes with ///\ref addSource(). Finally the actual path computation can be ///performed with one of the \ref start() functions.
• ## lemon/dim2.h

 r761 #include ///\ingroup geomdat ///\ingroup misc ///\file ///\brief A simple two dimensional vector and a bounding box implementation /// /// The class \ref lemon::dim2::Point "dim2::Point" implements /// a two dimensional vector with the usual operations. /// /// The class \ref lemon::dim2::Box "dim2::Box" can be used to determine /// the rectangular bounding box of a set of /// \ref lemon::dim2::Point "dim2::Point"'s. namespace lemon { namespace dim2 { /// \addtogroup geomdat /// \addtogroup misc /// @{
• ## lemon/gomory_hu.h

 r760 /// \c t. /// \code /// GomoryHu gom(g, capacities); /// GomoruHu gom(g, capacities); /// gom.run(); /// int cnt=0; /// for(GomoryHu::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt; /// for(GomoruHu::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt; /// \endcode class MinCutNodeIt /// \c t. /// \code /// GomoryHu gom(g, capacities); /// GomoruHu gom(g, capacities); /// gom.run(); /// int value=0; /// for(GomoryHu::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e) /// for(GomoruHu::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e) ///   value+=capacities[e]; /// \endcode
• ## lemon/min_cost_arborescence.h

 r760 /// The simplest way to execute the algorithm is to use /// one of the member functions called \c run(...). \n /// If you need better control on the execution, /// you have to call \ref init() first, then you can add several /// If you need more control on the execution, /// first you must call \ref init(), then you can add several /// source nodes with \ref addSource(). /// Finally \ref start() will perform the arborescence
• ## lemon/preflow.h

 r762 /// The type of the map that stores the flow values. /// It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. #ifdef DOXYGEN typedef GR::ArcMap FlowMap; #else typedef typename Digraph::template ArcMap FlowMap; #endif /// \brief Instantiates a FlowMap. /// The elevator type used by Preflow algorithm. /// /// \sa Elevator, LinkedElevator #ifdef DOXYGEN typedef lemon::Elevator Elevator; #else typedef lemon::Elevator Elevator; #endif /// \sa Elevator /// \sa LinkedElevator typedef LinkedElevator Elevator; /// \brief Instantiates an Elevator. /// The simplest way to execute the preflow algorithm is to use /// \ref run() or \ref runMinCut().\n /// If you need better control on the initial solution or the execution, /// you have to call one of the \ref init() functions first, then /// If you need more control on the initial solution or the execution, /// first you have to call one of the \ref init() functions, then /// \ref startFirstPhase() and if you need it \ref startSecondPhase().
Note: See TracChangeset for help on using the changeset viewer.