# Changeset 1555:48769ac7ec32 in lemon-0.x for lemon

Ignore:
Timestamp:
07/13/05 21:49:36 (15 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2051
Message:

Doc improvement

Location:
lemon
Files:
5 edited

Unmodified
Removed
• ## lemon/full_graph.h

 r1435 namespace lemon { /// \addtogroup graphs /// @{ class FullGraphBase { int NodeNum; typedef DefaultMappableGraphExtender MappableFullGraphBase; /// \addtogroup graphs /// @{ ///A full graph class. }; ///@} // Base graph class for UndirFullGraph. }; /// \addtogroup graphs /// @{ /// \todo UndirFullGraph from the UndirFullGraphBase /// @}
• ## lemon/graph_utils.h

 r1552 /// whenever the graph changes. /// /// \sa OutDegMap /// \sa InDegMap template
• ## lemon/kruskal.h

 r1547 /// This function runs Kruskal's algorithm to find a minimum cost tree. /// \param g The graph the algorithm runs on. The algorithm considers the /// graph to be undirected, the direction of the edges are not used. /// \param g The graph the algorithm runs on. /// It can be either \ref concept::StaticGraph "directed" or /// \ref concept::UndirStaticGraph "undirected". /// If the graph is directed, the algorithm consider it to be /// undirected by disregarding the direction of the edges. /// /// \param in This object is used to describe the edge costs. It must
• ## lemon/list_graph.h

 r1546 }; ///@} /**************** Undirected List Graph ****************/ AlterableUndirGraphExtender< UndirGraphExtender > > > > > > ErasableUndirListGraphBase; /// \addtogroup graphs /// @{ ///An undirected list graph class.
• ## lemon/maps.h

 r1547 //to document later ///\todo to document later template struct Const { }; //to document later ///\todo to document later template class ConstMap > : public MapBase
Note: See TracChangeset for help on using the changeset viewer.