[Lemon-commits] [lemon_svn] deba: r2307 - hugo/trunk/demo

[Lemon SVN]

Author: deba
Date: Fri Nov  4 18:33:33 2005
New Revision: 2307

Modified:
   hugo/trunk/demo/grid_graph_demo.cc
   hugo/trunk/demo/min_route.cc

Log:

Added doc to demos.

Modified: hugo/trunk/demo/grid_graph_demo.cc
==============================================================================
--- hugo/trunk/demo/grid_graph_demo.cc	(original)
+++ hugo/trunk/demo/grid_graph_demo.cc	Fri Nov  4 18:33:33 2005
@@ -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;
 }

Modified: hugo/trunk/demo/min_route.cc
==============================================================================
--- hugo/trunk/demo/min_route.cc	(original)
+++ hugo/trunk/demo/min_route.cc	Fri Nov  4 18:33:33 2005
@@ -27,6 +27,14 @@
 
 #include <cmath>
 
+/// \ingroup demos
+/// \file
+/// \brief Minimal route on a plan graph with eucledian distances.
+///
+/// Minimal route on a plan graph with eucledian distances.
+///
+/// \include min_route.cc
+
 
 using namespace lemon;