# HG changeset patch
# User alpar
# Date 1139217043 0
# Node ID 264811b995f3057abb6987df655fa36d9cfaf4d3
# Parent  5be9c1ca025221f567042b4ca49e6887c17e863c
Spellcheck

diff -r 5be9c1ca0252 -r 264811b995f3 demo/coloring.cc
--- a/demo/coloring.cc	Fri Feb 03 17:32:25 2006 +0000
+++ b/demo/coloring.cc	Mon Feb 06 09:10:43 2006 +0000
@@ -20,7 +20,7 @@
 ///\file
 ///\brief Coloring of a graph.
 ///
-/// This example shows how can we color the nodes of a plan graph efficiently
+/// This example shows how can we color the nodes of a planar graph efficiently
 /// with six colors.
 ///
 /// \include coloring.cc
@@ -48,7 +48,7 @@
   typedef Graph::UEdge UEdge;
   typedef Graph::IncEdgeIt IncEdgeIt;
 
-  std::cout << "Six coloring of a plan graph" << std::endl;
+  std::cout << "Six coloring of a planar graph" << std::endl;
   std::cout << "Input file: coloring.lgf" << std::endl;
   std::cout << "Output file: coloring.eps" << std::endl;
 
diff -r 5be9c1ca0252 -r 264811b995f3 demo/min_route.cc
--- a/demo/min_route.cc	Fri Feb 03 17:32:25 2006 +0000
+++ b/demo/min_route.cc	Mon Feb 06 09:10:43 2006 +0000
@@ -31,9 +31,9 @@
 
 /// \ingroup demos
 /// \file
-/// \brief Minimal route on a plan graph with eucledian distances.
+/// \brief Minimal route on a planar graph with eucledian distances.
 ///
-/// Minimal route on a plan graph with eucledian distances.
+/// Minimal route on a planar graph with eucledian distances.
 ///
 /// \include min_route.cc
 
diff -r 5be9c1ca0252 -r 264811b995f3 doc/graph_io.dox
--- a/doc/graph_io.dox	Fri Feb 03 17:32:25 2006 +0000
+++ b/doc/graph_io.dox	Mon Feb 06 09:10:43 2006 +0000
@@ -97,7 +97,7 @@
 
 \code
 @attributes
-title "Four colored plan graph"
+title "Four colored planar graph"
 author "Balazs DEZSO"
 copyright "Lemon Library"
 version 12