1.1 --- a/lemon/core.h	Thu Oct 09 13:52:01 2008 +0100
     1.2 +++ b/lemon/core.h	Thu Oct 09 14:37:44 2008 +0100
     1.3 @@ -58,7 +58,7 @@
     1.4    /// \addtogroup gutils
     1.5    /// @{
     1.6  
     1.7 -  ///Create convenient typedefs for the digraph types and iterators
     1.8 +  ///Create convenience typedefs for the digraph types and iterators
     1.9  
    1.10    ///This \c \#define creates convenient type definitions for the following
    1.11    ///types of \c Digraph: \c Node,  \c NodeIt, \c Arc, \c ArcIt, \c InArcIt,
    1.12 @@ -80,9 +80,9 @@
    1.13    typedef Digraph::NodeMap<double> DoubleNodeMap;                       \
    1.14    typedef Digraph::ArcMap<bool> BoolArcMap;                             \
    1.15    typedef Digraph::ArcMap<int> IntArcMap;                               \
    1.16 -  typedef Digraph::ArcMap<double> DoubleArcMap;
    1.17 +  typedef Digraph::ArcMap<double> DoubleArcMap
    1.18  
    1.19 -  ///Create convenient typedefs for the digraph types and iterators
    1.20 +  ///Create convenience typedefs for the digraph types and iterators
    1.21  
    1.22    ///\see DIGRAPH_TYPEDEFS
    1.23    ///
    1.24 @@ -100,9 +100,9 @@
    1.25    typedef typename Digraph::template NodeMap<double> DoubleNodeMap;     \
    1.26    typedef typename Digraph::template ArcMap<bool> BoolArcMap;           \
    1.27    typedef typename Digraph::template ArcMap<int> IntArcMap;             \
    1.28 -  typedef typename Digraph::template ArcMap<double> DoubleArcMap;
    1.29 +  typedef typename Digraph::template ArcMap<double> DoubleArcMap
    1.30  
    1.31 -  ///Create convenient typedefs for the graph types and iterators
    1.32 +  ///Create convenience typedefs for the graph types and iterators
    1.33  
    1.34    ///This \c \#define creates the same convenient type definitions as defined
    1.35    ///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates
    1.36 @@ -119,9 +119,9 @@
    1.37    typedef Graph::IncEdgeIt IncEdgeIt;                                   \
    1.38    typedef Graph::EdgeMap<bool> BoolEdgeMap;                             \
    1.39    typedef Graph::EdgeMap<int> IntEdgeMap;                               \
    1.40 -  typedef Graph::EdgeMap<double> DoubleEdgeMap;
    1.41 +  typedef Graph::EdgeMap<double> DoubleEdgeMap
    1.42  
    1.43 -  ///Create convenient typedefs for the graph types and iterators
    1.44 +  ///Create convenience typedefs for the graph types and iterators
    1.45  
    1.46    ///\see GRAPH_TYPEDEFS
    1.47    ///
    1.48 @@ -134,7 +134,7 @@
    1.49    typedef typename Graph::IncEdgeIt IncEdgeIt;                          \
    1.50    typedef typename Graph::template EdgeMap<bool> BoolEdgeMap;           \
    1.51    typedef typename Graph::template EdgeMap<int> IntEdgeMap;             \
    1.52 -  typedef typename Graph::template EdgeMap<double> DoubleEdgeMap;
    1.53 +  typedef typename Graph::template EdgeMap<double> DoubleEdgeMap
    1.54  
    1.55    /// \brief Function to count the items in a graph.
    1.56    ///
    1.57 @@ -1554,7 +1554,7 @@
    1.58      ///\note This is a dynamic data structure, therefore the data
    1.59      ///structure is updated after each graph alteration. Thus although
    1.60      ///this data structure is theoretically faster than \ref ArcLookUp
    1.61 -    ///and \ref AllArcLookup, it often provides worse performance than
    1.62 +    ///and \ref AllArcLookUp, it often provides worse performance than
    1.63      ///them.
    1.64      Arc operator()(Node s, Node t, Arc p = INVALID) const  {
    1.65        if (p == INVALID) {
    1.66 @@ -1699,8 +1699,8 @@
    1.67  
    1.68      ///Find an arc between two nodes.
    1.69  
    1.70 -    ///Find an arc between two nodes in time <em>O</em>(log<em>d</em>), where
    1.71 -    ///<em>d</em> is the number of outgoing arcs of \c s.
    1.72 +    ///Find an arc between two nodes in time <em>O</em>(log<em>d</em>),
    1.73 +    ///where <em>d</em> is the number of outgoing arcs of \c s.
    1.74      ///\param s The source node.
    1.75      ///\param t The target node.
    1.76      ///\return An arc from \c s to \c t if there exists,
    1.77 @@ -1817,8 +1817,8 @@
    1.78      ///for(Arc a = ae(u,v); a != INVALID; a=ae(u,v,a)) n++;
    1.79      ///\endcode
    1.80      ///
    1.81 -    ///Finding the first arc take <em>O</em>(log<em>d</em>) time, where
    1.82 -    ///<em>d</em> is the number of outgoing arcs of \c s. Then, the
    1.83 +    ///Finding the first arc take <em>O</em>(log<em>d</em>) time,
    1.84 +    ///where <em>d</em> is the number of outgoing arcs of \c s. Then the
    1.85      ///consecutive arcs are found in constant time.
    1.86      ///
    1.87      ///\warning If you change the digraph, refresh() must be called before using