diff -r 9fd56d75293e -r f19e108cb286 demo/grid_graph_demo.cc
--- a/demo/grid_graph_demo.cc	Fri Nov 04 16:40:54 2005 +0000
+++ b/demo/grid_graph_demo.cc	Fri Nov 04 17:33:33 2005 +0000
@@ -7,6 +7,25 @@
 #include <iostream>
 #include <fstream>
 
+///\ingroup demos
+///\file
+///\brief Labirinth example with grid graph.
+///
+///  Labirinth example with grid graph.
+///
+/// The input file is:
+///
+/// \include grid_graph_demo.in
+///
+/// The result:
+///
+/// \image html grid_graph_demo.png
+/// \image latex grid_graph_demo.eps "The labirinth" width=\textwidth
+///
+/// The source:
+///
+/// \include grid_graph_demo.cc
+
 using namespace lemon;
 using namespace std;
 
@@ -48,7 +67,7 @@
     path[bfs.predEdge(node)] = true;
   }
   
-  graphToEps(filtered, "grid_graph.eps").scaleToA4().
+  graphToEps(filtered, "grid_graph_demo.eps").scaleToA4().
     title("Grid graph").
     copyright("(C) 2005 LEMON Project").
     coords(scaleMap(indexMap(graph), 10)).
@@ -58,7 +77,8 @@
     edgeColors(composeMap(ColorSet(), path)).
     run();
   
-  std::cout << "The shortest path is written to grid_graph.eps" << std::endl;
+  std::cout << "The shortest path is written to grid_graph_demo.eps" 
+	    << std::endl;
 
   return 0;
 }