[Lemon-user] Contribution to LEMON tutorial

[Kovács Péter]

Hi Johannes,

Thank you in advance for your contribution. The source files of the 
LEMON tutorial are stored in a Mercurial (hg) repository, which is 
available here:
http://lemon.cs.elte.hu/hg/lemon-tutorial

After cloning the repository, you can build the tutorial locally on a 
Linux/Unix system like this:
./configure
make

You need to have LEMON installed before building the tutorial. The HTML 
output is generated into a directory 'html'. The contents of the 
tutorial sections are in the .dox files, written in Doxygen format. The 
images and demo files are located in the corresponding directories.

Once you made changes or extensions, you can commit them and share the 
patch files via the issue tracking system of LEMON:
https://lemon.cs.elte.hu/trac/lemon/wiki/IssueTracker

A patch file can be made from a commit or a sequence of commits like this:
hg export REVISIONS > ~/my_lemon_tutorial_changes.patch

I hope these hints are enough for getting started, but should you have 
other questions, do not hesitate to ask us.

Best regards,
Péter


2016.10.31. 20:04 keltezéssel, Johannes Sommer írta:
> Hi Péter,
>
> thank you for the link to the paper and the clarification for the
> similar functionality of LEMON's Dijkstra regarding the visitor concept.
> I only compared the shortest path algorithms of course. I added your
> comment in the article.
>
> I would be glad to contribute to the LEMON tutorial - but how?
>
> Regards,
> Johannes
>
> *Gesendet:* Freitag, 28. Oktober 2016 um 23:55 Uhr
> *Von:* "Kovács Péter" <kpeter at inf.elte.hu>
> *An:* "Johannes Sommer" <Johann.online at gmx.de>, lemon-user at lemon.cs.elte.hu
> *Betreff:* Re: FYI: Comparison of LEMON and Boost Graph Library
> Hi Johannes,
>
> Very nice articles, thanks for sharing them!
>
> In fact, we (the developers of LEMON) also made such comparisons to the
> Boost Graph Library and the LEDA library, in terms of both the API
> (usability, flexibility etc.) and performance. Our results are
> summarized in this paper:
> http://www.sciencedirect.com/science/article/pii/S1571066111000740
>
> I am glad to see that your benchmark results and conclusions are very
> similar to ours.
>
> Regards,
> Péter
>
>
> P.S. In the comparison article, you emphasize the visitor feature of
> BGL: "A big plus in my opinion is the so called visitor concept in the
> BGL." Actually, LEMON also provides similar features: you can execute
> the Dijkstra algorithm step by step and can inject custom codes as well
> by using custom map implementations, either for the input (lengthMap) or
> for the output (disMap, predMap, processedMap).
> Furthermore, visitors are also supported for other algorithms, e.g. BFS
> and DFS. For example,
> http://lemon.cs.elte.hu/pub/doc/1.3.1/a00053.html
>
> However, I admit that the documentation of LEMON could be further
> improved, e.g. several parts of the tutorial:
> http://lemon.cs.elte.hu/pub/tutorial/
>
> By chance, would you like to contribute? It would be very welcome!
>
>
>
>> Hi Lemon users and developers,
>>
>> I want you to know that I enjoy using LEMON very much. Thanks for the
>> great work!
>> For your interest: I compared LEMON and the Boost Graph Library in a
>> series of articles in my blog at: http://blog.sommer-forst.de:
>>
>> *
> http://blog.sommer-forst.de/2016/09/28/solving-the-shortest-path-problem-2-lemon-graph-library/
>> *
> http://blog.sommer-forst.de/2016/10/27/solving-the-shortest-path-problem-3-boost-graph-library/
>> *
> http://blog.sommer-forst.de/2016/10/28/solving-the-shortest-path-problem-4-comparison-of-lemon-and-bgl/
>> *
> http://blog.sommer-forst.de/2016/10/28/solving-the-shortest-path-problem-5-benchmarks/
>>
>> Especially the benchmark article may be interesting for someone who has
>> to decide which library to use.
>>
>> Best regards,
>> Johannes
>>
>>
>> _______________________________________________
>> Lemon-user mailing list
>> Lemon-user at lemon.cs.elte.hu
>> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>>
>