# HG changeset patch
# User alpar
# Date 1128683108 0
# Node ID e71778873dd03ec64c3ebfb9361324e20fbe4454
# Parent  66c89fe52d4e5326d2624b7cd79b67da2ac78c67
Doc improvments

diff -r 66c89fe52d4e -r e71778873dd0 demo/dijkstra_demo.cc
--- a/demo/dijkstra_demo.cc	Thu Oct 06 12:32:06 2005 +0000
+++ b/demo/dijkstra_demo.cc	Fri Oct 07 11:05:08 2005 +0000
@@ -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
diff -r 66c89fe52d4e -r e71778873dd0 doc/dirs.dox
--- a/doc/dirs.dox	Thu Oct 06 12:32:06 2005 +0000
+++ b/doc/dirs.dox	Fri Oct 07 11:05:08 2005 +0000
@@ -1,3 +1,28 @@
+/**
+\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
diff -r 66c89fe52d4e -r e71778873dd0 doc/graph_orientation.dox
--- a/doc/graph_orientation.dox	Thu Oct 06 12:32:06 2005 +0000
+++ b/doc/graph_orientation.dox	Fri Oct 07 11:05:08 2005 +0000
@@ -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