alpar@479: /**
alpar@995: \mainpage LEMON Documentation
alpar@479: 
ladanyi@666: \section intro Introduction
alpar@479: 
alpar@921: \subsection whatis What is LEMON
ladanyi@666: 
alpar@921: LEMON stands for
alpar@926: <b>L</b>ibrary of <b>E</b>fficient <b>M</b>odels
alpar@926: and <b>O</b>ptimization in <b>N</b>etworks.
alpar@670: It is a C++ template
alpar@670: library aimed at combinatorial optimization tasks which
alpar@670: often involve in working
alpar@991: with graphs.
alpar@991: 
alpar@991: <b>
alpar@995: LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>
alpar@995: project.
alpar@991: You are free to use it in your commertial or
alpar@991: non-commertial applications under very permissive
alpar@991: \ref license "license terms".
alpar@991: </b>
ladanyi@666: 
ladanyi@666: \subsection howtoread How to read this document
ladanyi@666: 
alpar@995: \ref graphs "Graph structures"
alpar@995: play central role in LEMON, so if you are new to it,
alpar@678: you probably should start \ref graphs "here".
alpar@678: You can also find this page along with others under
alpar@995: <a class="el" href="pages.html"> Related Pages </a>.
ladanyi@666: 
alpar@926: If you are 
alpar@926: interested about data structures and algorithms in more details, then
alpar@670: you should browse the reference manual part of the documentation.
alpar@995: Section <a class="el" href="modules.html"> Modules </a>
alpar@678:  is a good starting point for this.
ladanyi@666: 
ladanyi@666: */