COIN-OR::LEMON - Graph Library

Changeset 25:66d164ef72d1 in lemon-tutorial


Ignore:
Timestamp:
02/14/10 21:26:31 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Improve intro and getting started pages

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • getting_started.dox

    r23 r25  
    2121[PAGE]hello_lemon[PAGE] Compile Your First Code
    2222
    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.
     23First 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
     25Guide</b></a> for instructions).
     26In this section, we assume that you use a Linux environment and
     27<a href="http://gcc.gnu.org/">GCC</a> compiler.
     28
     29Once you have installed the library, you may paste the following code segment
     30into a file <tt>hello_lemon.cc</tt> to have a first working program that uses
     31LEMON.
    2832
    2933\dontinclude hello_lemon.cc
     
    3135\until }
    3236
    33 In this small example a directed graph is created with two nodes and
     37In this small example, a directed graph is created with two nodes and
    3438an arc added to it.
    3539
     
    7074If you managed to compile and run this example code without any problems,
    7175you may go on reading this tutorial to get to know the basic notions,
    72 features and tools of LEMON. However if you encountered problems that
     76features and tools of LEMON. However, if you encountered problems that
    7377you did not manage to solve, do not hesitate to
    7478<a href="mailto:lemon-user@lemon.cs.elte.hu"><b>contact us</b></a>.
  • intro.dox

    r24 r25  
    2323
    2424<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
     26efficient implementations of common data structures and algorithms with
     27focus on combinatorial optimization tasks connected mainly with graphs
     28and networks.
    2829
    2930<b>LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>
     
    3233under very permissive \ref license "license terms".</b>
    3334
    34 This library helps to write programs that solve optimization problems
    35 that arise frequently when designing and testing certain networks,
     35This library helps to write programs that solve various optimization problems,
     36which often arise when designing and testing certain networks,
    3637for example in telecommunication, computer networks, logistics, scheduling,
    3738and other areas.
    3839A 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,
     40Generally, if you want to write any program that works with graphs,
    4041then you might find it useful and convenient to use LEMON.
    4142
    42 For more information visit the LEMON web site:
     43For more information, visit the LEMON web site:
    4344<a href="http://lemon.cs.elte.hu/"><b>http://lemon.cs.elte.hu/</b></a>.
    4445
     
    5051
    5152After 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 used
     53LEMON with the help of the detailed documentation (which can be viewed
    5354as a reference manual).
    5455
Note: See TracChangeset for help on using the changeset viewer.