[Lemon-commits] [lemon_svn] alpar: r2535 - in hugo/trunk: demo doc
Lemon SVN
svn at lemon.cs.elte.hu
Mon Nov 6 20:53:22 CET 2006
Author: alpar
Date: Mon Feb 6 10:10:43 2006
New Revision: 2535
Modified:
hugo/trunk/demo/coloring.cc
hugo/trunk/demo/min_route.cc
hugo/trunk/doc/graph_io.dox
Log:
Spellcheck
Modified: hugo/trunk/demo/coloring.cc
==============================================================================
--- hugo/trunk/demo/coloring.cc (original)
+++ hugo/trunk/demo/coloring.cc Mon Feb 6 10:10:43 2006
@@ -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;
Modified: hugo/trunk/demo/min_route.cc
==============================================================================
--- hugo/trunk/demo/min_route.cc (original)
+++ hugo/trunk/demo/min_route.cc Mon Feb 6 10:10:43 2006
@@ -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
Modified: hugo/trunk/doc/graph_io.dox
==============================================================================
--- hugo/trunk/doc/graph_io.dox (original)
+++ hugo/trunk/doc/graph_io.dox Mon Feb 6 10:10:43 2006
@@ -97,7 +97,7 @@
\code
@attributes
-title "Four colored plan graph"
+title "Four colored planar graph"
author "Balazs DEZSO"
copyright "Lemon Library"
version 12
More information about the Lemon-commits
mailing list