COIN-OR::LEMON - Graph Library

Changeset 2474:e6368948d5f7 in lemon-0.x


Ignore:
Timestamp:
09/20/07 01:35:27 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3313
Message:

Small bug fixes and changes in the documentation.

Location:
lemon
Files:
6 edited

Legend:

Unmodified
Added
Removed
  • lemon/concepts/bpugraph.h

    r2391 r2474  
    1919/// \ingroup graph_concepts
    2020/// \file
    21 /// \brief Undirected bipartite graphs and components of.
    22 
     21/// \brief The concept of Bipartite Undirected Graphs.
    2322
    2423#ifndef LEMON_CONCEPT_BPUGRAPH_H
     
    3736    /// \addtogroup graph_concepts
    3837    /// @{
    39 
    40 
     38    ///
    4139    /// \brief Class describing the concept of Bipartite Undirected Graphs.
    4240    ///
  • lemon/concepts/graph.h

    r2391 r2474  
    2222///\ingroup graph_concepts
    2323///\file
    24 ///\brief Declaration of Graph.
     24///\brief The concept of Directed Graphs.
    2525
    2626#include <lemon/bits/invalid.h>
     
    3535    /// \addtogroup graph_concepts
    3636    /// @{
    37 
    38     /// The directed graph concept
    39 
     37    ///
     38    /// \brief Class describing the concept of Directed Graphs.
     39    ///
    4040    /// This class describes the \ref concept "concept" of the
    4141    /// immutable directed graphs.
  • lemon/concepts/graph_components.h

    r2391 r2474  
    1919///\ingroup graph_concepts
    2020///\file
    21 ///\brief The concept of the graph components.
     21///\brief The concept of graph components.
    2222
    2323
  • lemon/concepts/ugraph.h

    r2391 r2474  
    1919///\ingroup graph_concepts
    2020///\file
    21 ///\brief The concept of the undirected graphs.
    22 
     21///\brief The concept of Undirected Graphs.
    2322
    2423#ifndef LEMON_CONCEPT_UGRAPH_H
     
    3433    /// \addtogroup graph_concepts
    3534    /// @{
    36 
    37 
     35    ///
    3836    /// \brief Class describing the concept of Undirected Graphs.
    3937    ///
  • lemon/graph_utils.h

    r2391 r2474  
    3737///\file
    3838///\brief Graph utilities.
    39 ///
    40 ///
    41 
    4239
    4340namespace lemon {
     
    150147  /// graph structures it is specialized to run in O(1).
    151148  ///
    152   /// \todo refer how to specialize it
     149  /// \todo Refer how to specialize it.
    153150
    154151  template <typename Graph>
     
    183180  /// graph structures it is specialized to run in O(1).
    184181  ///
    185   /// \todo refer how to specialize it
     182  /// \todo Refer how to specialize it.
    186183
    187184  template <typename Graph>
     
    216213  /// graph structures it is specialized to run in O(1).
    217214  ///
    218   /// \todo refer how to specialize it
     215  /// \todo Refer how to specialize it.
    219216
    220217  template <typename Graph>
     
    376373  ///
    377374  ///\sa EdgeLookUp
    378   ///\se AllEdgeLookup
     375  ///\se AllEdgeLookUp
    379376  ///\sa ConEdgeIt
    380377  template <typename Graph>
     
    398395  ///\sa findEdge()
    399396  ///\sa EdgeLookUp
    400   ///\sa AllEdgeLookup
     397  ///\sa AllEdgeLookUp
    401398  ///
    402399  /// \author Balazs Dezso
     
    20422039  ///
    20432040  /// The SourceMap gives back the source Node of the given edge.
     2041  /// \see TargetMap
    20442042  /// \author Balazs Dezso
    20452043  template <typename Graph>
     
    20692067  };
    20702068
    2071   /// \brief Returns a \ref SourceMap class
     2069  /// \brief Returns a \ref SourceMap class.
    20722070  ///
    20732071  /// This function just returns an \ref SourceMap class.
     
    20812079  ///
    20822080  /// The TargetMap gives back the target Node of the given edge.
     2081  /// \see SourceMap
    20832082  /// \author Balazs Dezso
    20842083  template <typename Graph>
     
    21082107  };
    21092108
    2110   /// \brief Returns a \ref TargetMap class
     2109  /// \brief Returns a \ref TargetMap class.
    21112110  ///
    21122111  /// This function just returns a \ref TargetMap class.
     
    21202119  ///
    21212120  /// Returns the "forward" directed edge view of an undirected edge.
     2121  /// \see BackwardMap
    21222122  /// \author Balazs Dezso
    21232123  template <typename Graph>
     
    21472147  };
    21482148
    2149   /// \brief Returns a \ref ForwardMap class
     2149  /// \brief Returns a \ref ForwardMap class.
    21502150  ///
    21512151  /// This function just returns an \ref ForwardMap class.
     
    21592159  ///
    21602160  /// Returns the "backward" directed edge view of an undirected edge.
     2161  /// \see ForwardMap
    21612162  /// \author Balazs Dezso
    21622163  template <typename Graph>
     
    22252226  };
    22262227
    2227   /// \brief Just returns a PotentialDifferenceMap
    2228   ///
    2229   /// Just returns a PotentialDifferenceMap
     2228  /// \brief Returns a PotentialDifferenceMap.
     2229  ///
     2230  /// This function just returns a PotentialDifferenceMap.
    22302231  /// \relates PotentialDifferenceMap
    22312232  template <typename Graph, typename NodeMap>
  • lemon/min_cost_flow.h

    r2440 r2474  
    4040  /// \ref lemon::NetworkSimplex "NetworkSimplex", wich is the most
    4141  /// efficient implementation for the minimum cost flow problem in the
    42   /// Lemon library according to our benchmark tests.
     42  /// LEMON library according to our benchmark tests.
    4343  ///
    4444  /// \note There are three implementations for the minimum cost flow
Note: See TracChangeset for help on using the changeset viewer.