# HG changeset patch
# User alpar
# Date 1110143604 0
# Node ID ae69f556b429dfaf512982f534d53b125f975d87
# Parent  19eae67d97d536f71ea4336b23300f8ec6576c44
Doc improvements

diff -r 19eae67d97d5 -r ae69f556b429 doc/graphs.dox
--- a/doc/graphs.dox	Sun Mar 06 20:44:29 2005 +0000
+++ b/doc/graphs.dox	Sun Mar 06 21:13:24 2005 +0000
@@ -44,7 +44,8 @@
 attach data to the edges in such a way that the stored data
 are shared by the edge pairs. 
 \li \ref lemon::FullGraph "FullGraph"
-implements a complete graph. It is a \ref lemon::concept::StaticGraph, so you cannot
+implements a complete graph. It is a
+\ref lemon::concept::StaticGraph "StaticGraph", so you cannot
 change the number of nodes once it is constructed. It is extremely memory
 efficient: it uses constant amount of memory independently from the number of
 the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and
diff -r 19eae67d97d5 -r ae69f556b429 src/test/test_tools.h
--- a/src/test/test_tools.h	Sun Mar 06 20:44:29 2005 +0000
+++ b/src/test/test_tools.h	Sun Mar 06 21:13:24 2005 +0000
@@ -26,7 +26,7 @@
 
 //! \ingroup misc
 //! \file
-//! \brief Some utility to write test programs.
+//! \brief Some utilities to write test programs.
 
 
 ///If \c rc is fail, writes an error message end exit.
@@ -91,9 +91,9 @@
  return n;
 }
 
-/// \brief Adds to the graph the reverse pair of all edge.
+/// \brief Adds to the graph the reverse pair of all edges.
 ///
-/// Adds to the graph the reverse pair of all edge.
+/// Adds to the graph the reverse pair of all edges.
 ///
 template<class Graph> void bidirGraph(Graph &G)
 {