# HG changeset patch
# User alpar
# Date 1096536241 0
# Node ID b53cb2242a42dfaf80c07da0ef0b3ddf8b98abd9
# Parent  766eb8c9e3ab4ce6c26d3b1f0f54e2b404473102
Cosmetic changes.

diff -r 766eb8c9e3ab -r b53cb2242a42 doc/mainpage.dox
--- a/doc/mainpage.dox	Thu Sep 30 08:15:13 2004 +0000
+++ b/doc/mainpage.dox	Thu Sep 30 09:24:01 2004 +0000
@@ -6,8 +6,8 @@
 \subsection whatis What is LEMON
 
 LEMON stands for
-<it>L</it>ibrary of <it>E</it>fficient <it>M</it>odels
-and <it>O</it>ptimization in <it>N</it>etworks.
+<b>L</b>ibrary of <b>E</b>fficient <b>M</b>odels
+and <b>O</b>ptimization in <b>N</b>etworks.
 It is a C++ template
 library aimed at combinatorial optimization tasks which
 often involve in working
@@ -19,12 +19,10 @@
 Graph structures play central role in LEMON, so if you are new to it,
 you probably should start \ref graphs "here".
 You can also find this page along with others under
-<a href="pages.html"> Related Pages </a>
-(left-hand
-side frame).
+<a href="pages.html"> Related Pages </a>.
 
-If you are more
-interested in details about data structures and algorithms then
+If you are 
+interested about data structures and algorithms in more details, then
 you should browse the reference manual part of the documentation.
 Section <a href="modules.html"> Modules </a>
  is a good starting point for this.