# HG changeset patch
# User athos
# Date 1109068161 0
# Node ID 8b06fbd5712c9c058a2c7e2738d413e5568a545c
# Parent  66400041ef2acde85c35645f1095d7b8418cb33d
Started to change documentation with excellent new ideas!!!

diff -r 66400041ef2a -r 8b06fbd5712c doc/demoprograms.dox
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/doc/demoprograms.dox	Tue Feb 22 10:29:21 2005 +0000
@@ -0,0 +1,3 @@
+/**
+
+*/
\ No newline at end of file
diff -r 66400041ef2a -r 8b06fbd5712c doc/mainpage.dox
--- a/doc/mainpage.dox	Tue Feb 22 10:23:32 2005 +0000
+++ b/doc/mainpage.dox	Tue Feb 22 10:29:21 2005 +0000
@@ -10,7 +10,7 @@
 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
+often involve working
 with graphs.
 
 <b>
@@ -21,18 +21,20 @@
 \ref license "license terms".
 </b>
 
-\subsection howtoread How to read this document
+\subsection howtoread How to read the documentation
 
-\ref graphs "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 class="el" href="pages.html"> Related Pages </a>.
+If you want to get a quick start and see the most important features then 
+take a look at our \ref quicktour
+"Quick Tour to LEMON" which will guide you along.
 
-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 class="el" href="modules.html"> Modules </a>
- is a good starting point for this.
+If you 
+want to see how LEMON works, see 
+some \ref demoprograms demo programs!
+
+If you are looking for a specific thing then try to find it in the index or 
+in the contents.
+If you know what you are looking for then try to find it in the index or 
+in the table of contents.
+
 
 */
diff -r 66400041ef2a -r 8b06fbd5712c doc/mainpage1.dox
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/doc/mainpage1.dox	Tue Feb 22 10:29:21 2005 +0000
@@ -0,0 +1,37 @@
+/**
+\mainpage LEMON Documentation
+
+\section intro Introduction
+
+\subsection whatis What is LEMON
+
+LEMON stands for
+<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 with graphs.
+
+<b>
+LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>
+project.
+You are free to use it in your commercial or
+non-commercial applications under very permissive
+\ref license "license terms".
+</b>
+
+\subsection howtoread How to read this document
+
+\ref graphs "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 class="el" href="pages.html"> Related Pages </a>.
+
+If you are 
+interested in data structures and algorithms in more details, then
+you should browse the reference manual part of the documentation.
+Section <a class="el" href="modules.html"> Modules </a>
+ is a good starting point for this.
+
+*/
diff -r 66400041ef2a -r 8b06fbd5712c doc/quicktour.dox
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/doc/quicktour.dox	Tue Feb 22 10:29:21 2005 +0000
@@ -0,0 +1,14 @@
+/**
+
+\ref graphs "Graph structures"
+play a central role in LEMON, so if you are new to it,
+you probably should start \ref graphs "here".
+You can also find that page along with others under
+<a class="el" href="pages.html"> Related Pages </a>.
+
+If you are 
+interested in data structures and algorithms in more details, then
+you should browse the reference manual part of the documentation.
+Section <a class="el" href="modules.html"> Modules </a>
+ is a good starting point for this.
+*/
\ No newline at end of file