1.1 --- a/doc/graphs.dox	Sun Mar 06 20:44:29 2005 +0000
     1.2 +++ b/doc/graphs.dox	Sun Mar 06 21:13:24 2005 +0000
     1.3 @@ -44,7 +44,8 @@
     1.4  attach data to the edges in such a way that the stored data
     1.5  are shared by the edge pairs. 
     1.6  \li \ref lemon::FullGraph "FullGraph"
     1.7 -implements a complete graph. It is a \ref lemon::concept::StaticGraph, so you cannot
     1.8 +implements a complete graph. It is a
     1.9 +\ref lemon::concept::StaticGraph "StaticGraph", so you cannot
    1.10  change the number of nodes once it is constructed. It is extremely memory
    1.11  efficient: it uses constant amount of memory independently from the number of
    1.12  the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and

     2.1 --- a/src/test/test_tools.h	Sun Mar 06 20:44:29 2005 +0000
     2.2 +++ b/src/test/test_tools.h	Sun Mar 06 21:13:24 2005 +0000
     2.3 @@ -26,7 +26,7 @@
     2.4  
     2.5  //! \ingroup misc
     2.6  //! \file
     2.7 -//! \brief Some utility to write test programs.
     2.8 +//! \brief Some utilities to write test programs.
     2.9  
    2.10  
    2.11  ///If \c rc is fail, writes an error message end exit.
    2.12 @@ -91,9 +91,9 @@
    2.13   return n;
    2.14  }
    2.15  
    2.16 -/// \brief Adds to the graph the reverse pair of all edge.
    2.17 +/// \brief Adds to the graph the reverse pair of all edges.
    2.18  ///
    2.19 -/// Adds to the graph the reverse pair of all edge.
    2.20 +/// Adds to the graph the reverse pair of all edges.
    2.21  ///
    2.22  template<class Graph> void bidirGraph(Graph &G)
    2.23  {