[Lemon-commits] [lemon_svn] alpar: r2242 - in hugo/trunk: demo doc

[Lemon SVN]

Author: alpar
Date: Fri Oct  7 13:05:08 2005
New Revision: 2242

Modified:
   hugo/trunk/demo/dijkstra_demo.cc
   hugo/trunk/doc/dirs.dox
   hugo/trunk/doc/graph_orientation.dox

Log:
Doc improvments

Modified: hugo/trunk/demo/dijkstra_demo.cc
==============================================================================
--- hugo/trunk/demo/dijkstra_demo.cc	(original)
+++ hugo/trunk/demo/dijkstra_demo.cc	Fri Oct  7 13:05:08 2005
@@ -16,7 +16,7 @@
 
 ///\ingroup demos
 ///\file
-///\brief Demonstrating LEMON implementation of the Dijkstra algorithm
+///\brief Demonstrating the usage of LEMON's Dijkstra algorithm
 ///
 /// Dijkstra's algorithm computes shortest paths between two nodes in
 /// a graph with edge lengths. Here we only show some of the

Modified: hugo/trunk/doc/dirs.dox
==============================================================================
--- hugo/trunk/doc/dirs.dox	(original)
+++ hugo/trunk/doc/dirs.dox	Fri Oct  7 13:05:08 2005
@@ -1,4 +1,29 @@
 /**
+\dir demo
+\brief A collection of demo application.
+
+This directory contains several simple demo application, mainly
+for educational purposes.
+*/
+
+/**
+\dir doc
+\brief Auxiliary (and the whole generated) documentation.
+ Auxiliary (and the whole generated) documentation.
+*/
+
+/**
+\dir test
+\brief Test programs.
+
+This directory contains several test programs that check the consistency
+of the code.
+*/
+
+
+
+
+/**
 \dir lemon
 \brief Base include directory of LEMON
 

Modified: hugo/trunk/doc/graph_orientation.dox
==============================================================================
--- hugo/trunk/doc/graph_orientation.dox	(original)
+++ hugo/trunk/doc/graph_orientation.dox	Fri Oct  7 13:05:08 2005
@@ -101,7 +101,7 @@
 \skip active
 \until def
 
-We also store in a bool map which edges are reverted. Actually this is only
+We also store in a bool map indicating which edges are reverted. Actually this is only
 used to draw these edges with different color in the output picture. The
 algorithm will update this map called \c rev, but will not use it otherwise.
 \skip rev