COIN-OR::LEMON - Graph Library

Changeset 1959:264811b995f3 in lemon-0.x


Ignore:
Timestamp:
02/06/06 10:10:43 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2535
Message:

Spellcheck

Files:
3 edited

Legend:

Unmodified
Added
Removed
  • demo/coloring.cc

    r1956 r1959  
    2121///\brief Coloring of a graph.
    2222///
    23 /// This example shows how can we color the nodes of a plan graph efficiently
     23/// This example shows how can we color the nodes of a planar graph efficiently
    2424/// with six colors.
    2525///
     
    4949  typedef Graph::IncEdgeIt IncEdgeIt;
    5050
    51   std::cout << "Six coloring of a plan graph" << std::endl;
     51  std::cout << "Six coloring of a planar graph" << std::endl;
    5252  std::cout << "Input file: coloring.lgf" << std::endl;
    5353  std::cout << "Output file: coloring.eps" << std::endl;
  • demo/min_route.cc

    r1956 r1959  
    3232/// \ingroup demos
    3333/// \file
    34 /// \brief Minimal route on a plan graph with eucledian distances.
     34/// \brief Minimal route on a planar graph with eucledian distances.
    3535///
    36 /// Minimal route on a plan graph with eucledian distances.
     36/// Minimal route on a planar graph with eucledian distances.
    3737///
    3838/// \include min_route.cc
  • doc/graph_io.dox

    r1909 r1959  
    9898\code
    9999@attributes
    100 title "Four colored plan graph"
     100title "Four colored planar graph"
    101101author "Balazs DEZSO"
    102102copyright "Lemon Library"
Note: See TracChangeset for help on using the changeset viewer.