Changeset 25:66d164ef72d1 in lemon-tutorial
- Timestamp:
- 02/14/10 21:26:31 (15 years ago)
- Branch:
- default
- Phase:
- public
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
getting_started.dox
r23 r25 21 21 [PAGE]hello_lemon[PAGE] Compile Your First Code 22 22 23 First of all you have to install LEMON on your system (see 24 <a href="http://lemon.cs.elte.hu/trac/lemon/wiki/InstallGuide"><b>our 25 web page</b></a> for instructions). 26 After that you can paste the following code segment into a file 27 <tt>hello_lemon.cc</tt> to have a first working program that uses LEMON. 23 First of all, you have to install LEMON on your system (see the 24 <a href="http://lemon.cs.elte.hu/trac/lemon/wiki/InstallGuide"><b>Installation 25 Guide</b></a> for instructions). 26 In this section, we assume that you use a Linux environment and 27 <a href="http://gcc.gnu.org/">GCC</a> compiler. 28 29 Once you have installed the library, you may paste the following code segment 30 into a file <tt>hello_lemon.cc</tt> to have a first working program that uses 31 LEMON. 28 32 29 33 \dontinclude hello_lemon.cc … … 31 35 \until } 32 36 33 In this small example a directed graph is created with two nodes and37 In this small example, a directed graph is created with two nodes and 34 38 an arc added to it. 35 39 … … 70 74 If you managed to compile and run this example code without any problems, 71 75 you may go on reading this tutorial to get to know the basic notions, 72 features and tools of LEMON. However if you encountered problems that76 features and tools of LEMON. However, if you encountered problems that 73 77 you did not manage to solve, do not hesitate to 74 78 <a href="mailto:lemon-user@lemon.cs.elte.hu"><b>contact us</b></a>. -
intro.dox
r24 r25 23 23 24 24 <b>LEMON</b> stands for <b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling and 25 <b>O</b>ptimization in <b>N</b>etworks. It is a C++ template 26 library aimed at combinatorial optimization tasks, especially those 27 working with graphs and networks. 25 <b>O</b>ptimization in <b>N</b>etworks. It is a C++ template library providing 26 efficient implementations of common data structures and algorithms with 27 focus on combinatorial optimization tasks connected mainly with graphs 28 and networks. 28 29 29 30 <b>LEMON is an <a class="el" href="http://opensource.org/">open source</a> … … 32 33 under very permissive \ref license "license terms".</b> 33 34 34 This library helps to write programs that solve optimization problems35 that arise frequentlywhen designing and testing certain networks,35 This library helps to write programs that solve various optimization problems, 36 which often arise when designing and testing certain networks, 36 37 for example in telecommunication, computer networks, logistics, scheduling, 37 38 and other areas. 38 39 A very natural way of modelling these networks is by means of a graph. 39 Generally if you want to write any program that works with graphs,40 Generally, if you want to write any program that works with graphs, 40 41 then you might find it useful and convenient to use LEMON. 41 42 42 For more information visit the LEMON web site:43 For more information, visit the LEMON web site: 43 44 <a href="http://lemon.cs.elte.hu/"><b>http://lemon.cs.elte.hu/</b></a>. 44 45 … … 50 51 51 52 After getting familiar with the basics of the library, you may start using 52 LEMON with the help of the detailed documentation ( that can also be used53 LEMON with the help of the detailed documentation (which can be viewed 53 54 as a reference manual). 54 55
Note: See TracChangeset
for help on using the changeset viewer.