| author | alpar |
| Thu, 30 Sep 2004 08:13:51 +0000 | |
| changeset 924 | ccb657556d84 |
| parent 678 | a6bfd3346245 |
| child 926 | b53cb2242a42 |
| permissions | -rw-r--r-- |
| alpar@479 | 1 |
/** |
| alpar@479 | 2 |
\mainpage |
| 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@921 | 9 |
<it>L</it>ibrary of <it>E</it>fficient <it>M</it>odels |
| alpar@921 | 10 |
and <it>O</it>ptimization in <it>N</it>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 |
| ladanyi@666 | 14 |
with graphs. As the name also suggests, its development was started by |
| ladanyi@666 | 15 |
Hungarian people. |
| ladanyi@666 | 16 |
|
| ladanyi@666 | 17 |
\subsection howtoread How to read this document |
| ladanyi@666 | 18 |
|
| alpar@921 | 19 |
Graph structures play central role in LEMON, so if you are new to it, |
| alpar@678 | 20 |
you probably should start \ref graphs "here". |
| alpar@678 | 21 |
You can also find this page along with others under |
| alpar@678 | 22 |
<a href="pages.html"> Related Pages </a> |
| alpar@678 | 23 |
(left-hand |
| ladanyi@666 | 24 |
side frame). |
| ladanyi@666 | 25 |
|
| alpar@670 | 26 |
If you are more |
| alpar@670 | 27 |
interested in details about data structures and algorithms then |
| alpar@670 | 28 |
you should browse the reference manual part of the documentation. |
| alpar@678 | 29 |
Section <a href="modules.html"> Modules </a> |
| alpar@678 | 30 |
is a good starting point for this. |
| ladanyi@666 | 31 |
|
| ladanyi@666 | 32 |
*/ |