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