Added doc to demos.
authordeba
Fri, 04 Nov 2005 17:33:33 +0000
changeset 1775f19e108cb286
parent 1774 9fd56d75293e
child 1776 5214b33f954d
Added doc to demos.
demo/grid_graph_demo.cc
demo/min_route.cc
     1.1 --- a/demo/grid_graph_demo.cc	Fri Nov 04 16:40:54 2005 +0000
     1.2 +++ b/demo/grid_graph_demo.cc	Fri Nov 04 17:33:33 2005 +0000
     1.3 @@ -7,6 +7,25 @@
     1.4  #include <iostream>
     1.5  #include <fstream>
     1.6  
     1.7 +///\ingroup demos
     1.8 +///\file
     1.9 +///\brief Labirinth example with grid graph.
    1.10 +///
    1.11 +///  Labirinth example with grid graph.
    1.12 +///
    1.13 +/// The input file is:
    1.14 +///
    1.15 +/// \include grid_graph_demo.in
    1.16 +///
    1.17 +/// The result:
    1.18 +///
    1.19 +/// \image html grid_graph_demo.png
    1.20 +/// \image latex grid_graph_demo.eps "The labirinth" width=\textwidth
    1.21 +///
    1.22 +/// The source:
    1.23 +///
    1.24 +/// \include grid_graph_demo.cc
    1.25 +
    1.26  using namespace lemon;
    1.27  using namespace std;
    1.28  
    1.29 @@ -48,7 +67,7 @@
    1.30      path[bfs.predEdge(node)] = true;
    1.31    }
    1.32    
    1.33 -  graphToEps(filtered, "grid_graph.eps").scaleToA4().
    1.34 +  graphToEps(filtered, "grid_graph_demo.eps").scaleToA4().
    1.35      title("Grid graph").
    1.36      copyright("(C) 2005 LEMON Project").
    1.37      coords(scaleMap(indexMap(graph), 10)).
    1.38 @@ -58,7 +77,8 @@
    1.39      edgeColors(composeMap(ColorSet(), path)).
    1.40      run();
    1.41    
    1.42 -  std::cout << "The shortest path is written to grid_graph.eps" << std::endl;
    1.43 +  std::cout << "The shortest path is written to grid_graph_demo.eps" 
    1.44 +	    << std::endl;
    1.45  
    1.46    return 0;
    1.47  }
     2.1 --- a/demo/min_route.cc	Fri Nov 04 16:40:54 2005 +0000
     2.2 +++ b/demo/min_route.cc	Fri Nov 04 17:33:33 2005 +0000
     2.3 @@ -27,6 +27,14 @@
     2.4  
     2.5  #include <cmath>
     2.6  
     2.7 +/// \ingroup demos
     2.8 +/// \file
     2.9 +/// \brief Minimal route on a plan graph with eucledian distances.
    2.10 +///
    2.11 +/// Minimal route on a plan graph with eucledian distances.
    2.12 +///
    2.13 +/// \include min_route.cc
    2.14 +
    2.15  
    2.16  using namespace lemon;
    2.17