| author | alpar |
| Wed, 12 Jan 2005 12:51:30 +0000 | |
| changeset 1076 | 67a115cdade4 |
| parent 995 | e5216825f71b |
| child 1169 | 8b06fbd5712c |
| permissions | -rw-r--r-- |
| alpar@479 | 1 |
/** |
| alpar@995 | 2 |
\mainpage LEMON Documentation |
| alpar@479 | 3 |
|
| ladanyi@666 | 4 |
\section intro Introduction |
| alpar@479 | 5 |
|
| alpar@921 | 6 |
\subsection whatis What is LEMON |
| ladanyi@666 | 7 |
|
| alpar@921 | 8 |
LEMON stands for |
| alpar@926 | 9 |
<b>L</b>ibrary of <b>E</b>fficient <b>M</b>odels |
| alpar@926 | 10 |
and <b>O</b>ptimization in <b>N</b>etworks. |
| alpar@670 | 11 |
It is a C++ template |
| alpar@670 | 12 |
library aimed at combinatorial optimization tasks which |
| alpar@670 | 13 |
often involve in working |
| alpar@991 | 14 |
with graphs. |
| alpar@991 | 15 |
|
| alpar@991 | 16 |
<b> |
| alpar@995 | 17 |
LEMON is an <a class="el" href="http://opensource.org/">open source</a> |
| alpar@995 | 18 |
project. |
| marci@1003 | 19 |
You are free to use it in your commercial or |
| marci@1003 | 20 |
non-commercial applications under very permissive |
| alpar@991 | 21 |
\ref license "license terms". |
| alpar@991 | 22 |
</b> |
| ladanyi@666 | 23 |
|
| ladanyi@666 | 24 |
\subsection howtoread How to read this document |
| ladanyi@666 | 25 |
|
| alpar@995 | 26 |
\ref graphs "Graph structures" |
| alpar@995 | 27 |
play central role in LEMON, so if you are new to it, |
| alpar@678 | 28 |
you probably should start \ref graphs "here". |
| alpar@678 | 29 |
You can also find this page along with others under |
| alpar@995 | 30 |
<a class="el" href="pages.html"> Related Pages </a>. |
| ladanyi@666 | 31 |
|
| alpar@926 | 32 |
If you are |
| alpar@926 | 33 |
interested about data structures and algorithms in more details, then |
| alpar@670 | 34 |
you should browse the reference manual part of the documentation. |
| alpar@995 | 35 |
Section <a class="el" href="modules.html"> Modules </a> |
| alpar@678 | 36 |
is a good starting point for this. |
| ladanyi@666 | 37 |
|
| ladanyi@666 | 38 |
*/ |