# Changeset 2350:eb371753e814 in lemon-0.x

Ignore:
Timestamp:
01/23/07 13:51:39 (17 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3142
Message:

Several doc improvements.

Files:
13 edited

Unmodified
Removed
• ## demo/maps_summary.cc

 r2209 ///\ingroup demos ///\file maps_summary demo program ///\brief Introduction to LEMON maps ///\file ///\brief An introduction to LEMON maps /// /// \include maps_summary.cc
• ## doc/basic_concepts.dox

 r2288 namespace lemon { /** \page basic_concepts Basic concepts graph representations. It has an undirected version too: ListUGraph. */ }
• ## doc/dirs.dox

 r2157 /** \dir concept \dir concepts \brief Concept descriptors and checking classes
• ## doc/groups.dox

 r2260 /** @defgroup gutils General Graph Utilities @ingroup algs \brief This group describes some simple general graph utilities. This group describes some simple general graph utilities. @defgroup gutils Basic Graph Utilities @ingroup algs \brief This group describes some simple basic graph utilities. This group describes some simple basic graph utilities. */
• ## lemon/bfs.h

 r2335 ///should be initially false. /// ///\param target The nodemaps of possible targets. ///\param nm The nodemaps of possible targets. ///\retval reached Indicates that one of the target nodes is reached. ///\return The processed node. ///\param nm must be a bool (or convertible) node map. The ///algorithm will stop when it reached a node \c v with ///nm[v] true. /// nm[v] true. ///\todo query the reached target template /// should be initially false. /// /// \param target The nodemaps of possible targets. /// \param nm The nodemaps of possible targets. /// \retval reached Indicates that one of the target nodes is reached. /// \return The processed node. ///\param nm must be a bool (or convertible) node map. The ///algorithm will stop when it reached a node \c v with ///nm[v] true. /// nm[v] true. template void start(const NM &nm) {
• ## lemon/elevator.h

 r2349 ///Lift an active item to a higher level. ///\params i The item to be lifted. It must be active. ///\params new_level The new level of \c i. It must be strictly higher ///\param i The item to be lifted. It must be active. ///\param new_level The new level of \c i. It must be strictly higher ///than the current level. ///
• ## lemon/eps.h

 r2214 ///\param x The \c x coordinate of the node ///\param y The \c y coordinate of the node ///\param r The size (radius) of the node ///\param col Color of the node. The default color is white ///\param brd Color of the node border. The default color is black ///\param t The shape of the drawn object ///\param pos Position of the node ///\param r The size (radius) of the node ///\param col Color of the node. The default color is white ///\param brd Color of the node border. The default color is black
• ## lemon/euler.h

 r1993 /// \ingroup topology ///This iterator converts to the \c Edge (or \cUEdge) ///This iterator converts to the \c Edge (or \c UEdge) ///type of the graph and using ///operator ++ it provides an Euler tour of an \undirected ///operator ++ it provides an Euler tour of an undirected ///graph (if there exists). ///
• ## lemon/graph_utils.h

 r2331 ///\sa findEdge() ///\sa EdgeLookUp ///\se AllEdgeLookup ///\sa AllEdgeLookup /// /// \author Balazs Dezso ///\param prev The previous edge between \c s and \c t. It it is INVALID or ///not given, the operator finds the first appropriate edge. ///\return An edge from \c s to \c t after \prev or ///\return An edge from \c s to \c t after \c prev or ///\ref INVALID if there is no more. ///
• ## lemon/path_utils.h

 r2335 /// /// Checks that each edge's target is the next's source. /// \Checks the path's consistency. /// /// Checks that each edge's target is the next's source. /// template bool checkPath(const Graph& graph, const Path& path) {
• ## lemon/preflow.h

 r2330 ///\param _cap The capacity of the edges. ///\param _f The flow of the edges. ///\param tol Tolerance class. ///\param _sr Tolerance class. ///Except the graph, all of these parameters can be reset by ///calling \ref source, \ref target, \ref capacityMap and \ref
• ## lemon/smart_graph.h

 r2343 ///This constructor immediately makes a snapshot of the graph. ///\param _g The graph we make a snapshot of. ///\param g The graph we make a snapshot of. Snapshot(SmartUGraph &g) { g.saveSnapshot(*this); ///This function can be called more than once. In case of a repeated ///call, the previous snapshot gets lost. ///\param _g The graph we make the snapshot of. ///\param g The graph we make the snapshot of. void save(SmartUGraph &g) {
• ## lemon/ssp_min_cost_flow.h

 r2276 ///\ingroup flowalgs /// ///\file \brief An algorithm for finding a flow of value \c k (for ///\file ///\brief An algorithm for finding a flow of value \c k (for ///small values of \c k) having minimal total cost
Note: See TracChangeset for help on using the changeset viewer.