1.1 --- a/lemon/core.h	Wed Oct 08 17:05:01 2008 +0100
     1.2 +++ b/lemon/core.h	Thu Oct 09 10:09:44 2008 +0200
     1.3 @@ -1554,7 +1554,7 @@
     1.4      ///\note This is a dynamic data structure, therefore the data
     1.5      ///structure is updated after each graph alteration. Thus although
     1.6      ///this data structure is theoretically faster than \ref ArcLookUp
     1.7 -    ///and \ref AllArcLookup, it often provides worse performance than
     1.8 +    ///and \ref AllArcLookUp, it often provides worse performance than
     1.9      ///them.
    1.10      Arc operator()(Node s, Node t, Arc p = INVALID) const  {
    1.11        if (p == INVALID) {
    1.12 @@ -1699,8 +1699,8 @@
    1.13  
    1.14      ///Find an arc between two nodes.
    1.15  
    1.16 -    ///Find an arc between two nodes in time <em>O</em>(log<em>d</em>), where
    1.17 -    ///<em>d</em> is the number of outgoing arcs of \c s.
    1.18 +    ///Find an arc between two nodes in time <em>O</em>(log<em>d</em>),
    1.19 +    ///where <em>d</em> is the number of outgoing arcs of \c s.
    1.20      ///\param s The source node.
    1.21      ///\param t The target node.
    1.22      ///\return An arc from \c s to \c t if there exists,
    1.23 @@ -1817,8 +1817,8 @@
    1.24      ///for(Arc a = ae(u,v); a != INVALID; a=ae(u,v,a)) n++;
    1.25      ///\endcode
    1.26      ///
    1.27 -    ///Finding the first arc take <em>O</em>(log<em>d</em>) time, where
    1.28 -    ///<em>d</em> is the number of outgoing arcs of \c s. Then, the
    1.29 +    ///Finding the first arc take <em>O</em>(log<em>d</em>) time,
    1.30 +    ///where <em>d</em> is the number of outgoing arcs of \c s. Then the
    1.31      ///consecutive arcs are found in constant time.
    1.32      ///
    1.33      ///\warning If you change the digraph, refresh() must be called before using