COIN-OR::LEMON - Graph Library

Changeset 1555:48769ac7ec32 in lemon-0.x


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

Doc improvement

Files:
6 edited

Legend:

Unmodified
Added
Removed
  • doc/Doxyfile.in

    r1549 r1555  
    236236# If set to NO only classes defined in header files are included.
    237237
    238 EXTRACT_LOCAL_CLASSES  = YES
     238EXTRACT_LOCAL_CLASSES  = NO
    239239
    240240# This flag is only useful for Objective-C code. When set to YES local
  • lemon/full_graph.h

    r1435 r1555  
    3636namespace lemon {
    3737
    38 /// \addtogroup graphs
    39 /// @{
    40 
    4138  class FullGraphBase {
    4239    int NodeNum;
     
    196193  typedef DefaultMappableGraphExtender<IterableFullGraphBase> MappableFullGraphBase;
    197194
     195  /// \addtogroup graphs
     196  /// @{
     197
    198198  ///A full graph class.
    199199
     
    212212  };
    213213
     214  ///@}
    214215
    215216  // Base graph class for UndirFullGraph.
     
    374375  };
    375376
     377  /// \addtogroup graphs
     378  /// @{
     379
     380 
    376381  /// \todo UndirFullGraph from the UndirFullGraphBase
    377382
    378  
    379383
    380384  /// @} 
  • lemon/graph_utils.h

    r1552 r1555  
    10931093  /// whenever the graph changes.
    10941094  ///
    1095   /// \sa OutDegMap
     1095  /// \sa InDegMap
    10961096
    10971097  template <typename _Graph>
  • lemon/kruskal.h

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

    r1546 r1555  
    540540  };
    541541
     542  ///@}
    542543
    543544  /**************** Undirected List Graph ****************/
     
    550551    AlterableUndirGraphExtender<
    551552    UndirGraphExtender<ListGraphBase> > > > > > > ErasableUndirListGraphBase;
     553
     554/// \addtogroup graphs
     555/// @{
    552556
    553557  ///An undirected list graph class.
  • lemon/maps.h

    r1547 r1555  
    121121
    122122
    123   //to document later
     123  ///\todo to document later
    124124  template<typename T, T v>
    125125  struct Const { };
    126   //to document later
     126  ///\todo to document later
    127127  template<typename K, typename V, V v>
    128128  class ConstMap<K, Const<V, v> > : public MapBase<K, V>
Note: See TracChangeset for help on using the changeset viewer.