1.1 --- a/demo/coloring.cc	Fri Feb 03 17:32:25 2006 +0000
     1.2 +++ b/demo/coloring.cc	Mon Feb 06 09:10:43 2006 +0000
     1.3 @@ -20,7 +20,7 @@
     1.4  ///\file
     1.5  ///\brief Coloring of a graph.
     1.6  ///
     1.7 -/// This example shows how can we color the nodes of a plan graph efficiently
     1.8 +/// This example shows how can we color the nodes of a planar graph efficiently
     1.9  /// with six colors.
    1.10  ///
    1.11  /// \include coloring.cc
    1.12 @@ -48,7 +48,7 @@
    1.13    typedef Graph::UEdge UEdge;
    1.14    typedef Graph::IncEdgeIt IncEdgeIt;
    1.15  
    1.16 -  std::cout << "Six coloring of a plan graph" << std::endl;
    1.17 +  std::cout << "Six coloring of a planar graph" << std::endl;
    1.18    std::cout << "Input file: coloring.lgf" << std::endl;
    1.19    std::cout << "Output file: coloring.eps" << std::endl;
    1.20  

     2.1 --- a/demo/min_route.cc	Fri Feb 03 17:32:25 2006 +0000
     2.2 +++ b/demo/min_route.cc	Mon Feb 06 09:10:43 2006 +0000
     2.3 @@ -31,9 +31,9 @@
     2.4  
     2.5  /// \ingroup demos
     2.6  /// \file
     2.7 -/// \brief Minimal route on a plan graph with eucledian distances.
     2.8 +/// \brief Minimal route on a planar graph with eucledian distances.
     2.9  ///
    2.10 -/// Minimal route on a plan graph with eucledian distances.
    2.11 +/// Minimal route on a planar graph with eucledian distances.
    2.12  ///
    2.13  /// \include min_route.cc
    2.14  

     3.1 --- a/doc/graph_io.dox	Fri Feb 03 17:32:25 2006 +0000
     3.2 +++ b/doc/graph_io.dox	Mon Feb 06 09:10:43 2006 +0000
     3.3 @@ -97,7 +97,7 @@
     3.4  
     3.5  \code
     3.6  @attributes
     3.7 -title "Four colored plan graph"
     3.8 +title "Four colored planar graph"
     3.9  author "Balazs DEZSO"
    3.10  copyright "Lemon Library"
    3.11  version 12