# Changeset 758:49b1a30c4dc4 in lemon-0.x

Ignore:
Timestamp:
08/05/04 13:38:26 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1018
Message:

New Doxygen module for path/flow algs.

Files:
5 edited

Unmodified
Removed
• ## doc/groups.dox

 r678 /** @defgroup spantree Minimum Cost Spanning Tree Algorithms \brief This group containes the algorithms for finding a minimum cost spanning tree in a graph @defgroup flowalgs Path and Flow Algorithms @ingroup galgs \brief This group describes the algorithms for finding paths and flows in graphs. */
• ## src/hugo/dijkstra.h

 r734 #define HUGO_DIJKSTRA_H ///\ingroup galgs ///\ingroup flowalgs ///\file ///\brief Dijkstra algorithm. namespace hugo { /// \addtogroup galgs /// \addtogroup flowalgs /// @{
• ## src/hugo/max_flow.h

 r757 /// \file /// \ingroup galgs /// \ingroup flowalgs namespace hugo { /// \addtogroup galgs /// @{ /// \addtogroup flowalgs /// @{ ///Maximum flow algorithms class. ///\ref setFlow. Before any subsequent runs of any algorithm of ///the class \ref setFlow should be called. /// ///After running an algorithm of the class, the actual flow value ///can be obtained by calling \ref flowValue(). The minimum ///calling \ref minCut. (\ref minMinCut and \ref maxMinCut writes ///the inclusionwise minimum and maximum of the minimum value ///cuts, resp.) ///cuts, resp.) /// ///\param Graph The directed graph type the algorithm runs on. ///\param Num The number type of the capacities and the flow values. ///\param CapMap The capacity map type. ///\param FlowMap The flow map type. ///\param FlowMap The flow map type. /// ///\author Marton Makai, Jacint Szabo template
• ## src/hugo/mincostflows.h

 r661 #define HUGO_MINCOSTFLOWS_H ///\ingroup galgs ///\ingroup flowalgs ///\file ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost namespace hugo { /// \addtogroup galgs /// \addtogroup flowalgs /// @{
• ## src/work/johanna/kruskal.h

 r755 #include /** @defgroup spantree Minimum Cost Spanning Tree Algorithms \brief This group containes the algorithms for finding a minimum cost spanning tree in a graph @ingroup galgs */ ///\ingroup spantree ///\file ///\brief Kruskal's algorithm to compute a minimum cost tree namespace hugo { /// \addtogroup spantree /// @{ /// Kruskal's algorithm to find a minimum cost tree of a graph. } /// @} } //namespace hugo
Note: See TracChangeset for help on using the changeset viewer.