COIN-OR::LEMON - Graph Library

Changeset 1775:f19e108cb286 in lemon-0.x for demo


Ignore:
Timestamp:
11/04/05 18:33:33 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2307
Message:

Added doc to demos.

Location:
demo
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • demo/grid_graph_demo.cc

    r1763 r1775  
    77#include <iostream>
    88#include <fstream>
     9
     10///\ingroup demos
     11///\file
     12///\brief Labirinth example with grid graph.
     13///
     14///  Labirinth example with grid graph.
     15///
     16/// The input file is:
     17///
     18/// \include grid_graph_demo.in
     19///
     20/// The result:
     21///
     22/// \image html grid_graph_demo.png
     23/// \image latex grid_graph_demo.eps "The labirinth" width=\textwidth
     24///
     25/// The source:
     26///
     27/// \include grid_graph_demo.cc
    928
    1029using namespace lemon;
     
    4968  }
    5069 
    51   graphToEps(filtered, "grid_graph.eps").scaleToA4().
     70  graphToEps(filtered, "grid_graph_demo.eps").scaleToA4().
    5271    title("Grid graph").
    5372    copyright("(C) 2005 LEMON Project").
     
    5978    run();
    6079 
    61   std::cout << "The shortest path is written to grid_graph.eps" << std::endl;
     80  std::cout << "The shortest path is written to grid_graph_demo.eps"
     81            << std::endl;
    6282
    6383  return 0;
  • demo/min_route.cc

    r1636 r1775  
    2727
    2828#include <cmath>
     29
     30/// \ingroup demos
     31/// \file
     32/// \brief Minimal route on a plan graph with eucledian distances.
     33///
     34/// Minimal route on a plan graph with eucledian distances.
     35///
     36/// \include min_route.cc
    2937
    3038
Note: See TracChangeset for help on using the changeset viewer.