<html><head></head><body><div style="font-family: Verdana;font-size: 12.0px;"><div>
<div>Hi Péter,</div>
<div> </div>
<div>thanks for the information. Unfortunately I was not able to register to the trac system of lemon. The URL at https://lemon.cs.elte.hu/trac/lemon/wiki/IssueTracker tells that one should register using the following link: https://lemon.cs.elte.hu/trac/lemon/register. But when I open this link an error message occurs: Error: Not found. No handler matched request to /register.</div>
<div> </div>
<div>Regards,</div>
<div>Johannes</div>
<div>
<div name="quote" style="margin:10px 5px 5px 10px; padding: 10px 0 10px 10px; border-left:2px solid #C3D9E5; word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;">
<div style="margin:0 0 10px 0;"><b>Gesendet:</b> Donnerstag, 03. November 2016 um 10:20 Uhr<br/>
<b>Von:</b> "Kovács Péter" <kpeter@inf.elte.hu><br/>
<b>An:</b> "Johannes Sommer" <Johann.online@gmx.de><br/>
<b>Cc:</b> lemon-user@lemon.cs.elte.hu<br/>
<b>Betreff:</b> Contribution to LEMON tutorial</div>
<div name="quoted-content">Hi Johannes,<br/>
<br/>
Thank you in advance for your contribution. The source files of the<br/>
LEMON tutorial are stored in a Mercurial (hg) repository, which is<br/>
available here:<br/>
<a href="http://lemon.cs.elte.hu/hg/lemon-tutorial" target="_blank">http://lemon.cs.elte.hu/hg/lemon-tutorial</a><br/>
<br/>
After cloning the repository, you can build the tutorial locally on a<br/>
Linux/Unix system like this:<br/>
./configure<br/>
make<br/>
<br/>
You need to have LEMON installed before building the tutorial. The HTML<br/>
output is generated into a directory 'html'. The contents of the<br/>
tutorial sections are in the .dox files, written in Doxygen format. The<br/>
images and demo files are located in the corresponding directories.<br/>
<br/>
Once you made changes or extensions, you can commit them and share the<br/>
patch files via the issue tracking system of LEMON:<br/>
<a href="https://lemon.cs.elte.hu/trac/lemon/wiki/IssueTracker" target="_blank">https://lemon.cs.elte.hu/trac/lemon/wiki/IssueTracker</a><br/>
<br/>
A patch file can be made from a commit or a sequence of commits like this:<br/>
hg export REVISIONS > ~/my_lemon_tutorial_changes.patch<br/>
<br/>
I hope these hints are enough for getting started, but should you have<br/>
other questions, do not hesitate to ask us.<br/>
<br/>
Best regards,<br/>
Péter<br/>
<br/>
<br/>
2016.10.31. 20:04 keltezéssel, Johannes Sommer írta:<br/>
> Hi Péter,<br/>
><br/>
> thank you for the link to the paper and the clarification for the<br/>
> similar functionality of LEMON's Dijkstra regarding the visitor concept.<br/>
> I only compared the shortest path algorithms of course. I added your<br/>
> comment in the article.<br/>
><br/>
> I would be glad to contribute to the LEMON tutorial - but how?<br/>
><br/>
> Regards,<br/>
> Johannes<br/>
><br/>
> *Gesendet:* Freitag, 28. Oktober 2016 um 23:55 Uhr<br/>
> *Von:* "Kovács Péter" <kpeter@inf.elte.hu><br/>
> *An:* "Johannes Sommer" <Johann.online@gmx.de>, lemon-user@lemon.cs.elte.hu<br/>
> *Betreff:* Re: FYI: Comparison of LEMON and Boost Graph Library<br/>
> Hi Johannes,<br/>
><br/>
> Very nice articles, thanks for sharing them!<br/>
><br/>
> In fact, we (the developers of LEMON) also made such comparisons to the<br/>
> Boost Graph Library and the LEDA library, in terms of both the API<br/>
> (usability, flexibility etc.) and performance. Our results are<br/>
> summarized in this paper:<br/>
> <a href="http://www.sciencedirect.com/science/article/pii/S1571066111000740" target="_blank">http://www.sciencedirect.com/science/article/pii/S1571066111000740</a><br/>
><br/>
> I am glad to see that your benchmark results and conclusions are very<br/>
> similar to ours.<br/>
><br/>
> Regards,<br/>
> Péter<br/>
><br/>
><br/>
> P.S. In the comparison article, you emphasize the visitor feature of<br/>
> BGL: "A big plus in my opinion is the so called visitor concept in the<br/>
> BGL." Actually, LEMON also provides similar features: you can execute<br/>
> the Dijkstra algorithm step by step and can inject custom codes as well<br/>
> by using custom map implementations, either for the input (lengthMap) or<br/>
> for the output (disMap, predMap, processedMap).<br/>
> Furthermore, visitors are also supported for other algorithms, e.g. BFS<br/>
> and DFS. For example,<br/>
> <a href="http://lemon.cs.elte.hu/pub/doc/1.3.1/a00053.html" target="_blank">http://lemon.cs.elte.hu/pub/doc/1.3.1/a00053.html</a><br/>
><br/>
> However, I admit that the documentation of LEMON could be further<br/>
> improved, e.g. several parts of the tutorial:<br/>
> <a href="http://lemon.cs.elte.hu/pub/tutorial/" target="_blank">http://lemon.cs.elte.hu/pub/tutorial/</a><br/>
><br/>
> By chance, would you like to contribute? It would be very welcome!<br/>
><br/>
><br/>
><br/>
>> Hi Lemon users and developers,<br/>
>><br/>
>> I want you to know that I enjoy using LEMON very much. Thanks for the<br/>
>> great work!<br/>
>> For your interest: I compared LEMON and the Boost Graph Library in a<br/>
>> series of articles in my blog at: <a href="http://blog.sommer-forst.de" target="_blank">http://blog.sommer-forst.de</a>:<br/>
>><br/>
>> *<br/>
> <a href="http://blog.sommer-forst.de/2016/09/28/solving-the-shortest-path-problem-2-lemon-graph-library/" target="_blank">http://blog.sommer-forst.de/2016/09/28/solving-the-shortest-path-problem-2-lemon-graph-library/</a><br/>
>> *<br/>
> <a href="http://blog.sommer-forst.de/2016/10/27/solving-the-shortest-path-problem-3-boost-graph-library/" target="_blank">http://blog.sommer-forst.de/2016/10/27/solving-the-shortest-path-problem-3-boost-graph-library/</a><br/>
>> *<br/>
> <a href="http://blog.sommer-forst.de/2016/10/28/solving-the-shortest-path-problem-4-comparison-of-lemon-and-bgl/" target="_blank">http://blog.sommer-forst.de/2016/10/28/solving-the-shortest-path-problem-4-comparison-of-lemon-and-bgl/</a><br/>
>> *<br/>
> <a href="http://blog.sommer-forst.de/2016/10/28/solving-the-shortest-path-problem-5-benchmarks/" target="_blank">http://blog.sommer-forst.de/2016/10/28/solving-the-shortest-path-problem-5-benchmarks/</a><br/>
>><br/>
>> Especially the benchmark article may be interesting for someone who has<br/>
>> to decide which library to use.<br/>
>><br/>
>> Best regards,<br/>
>> Johannes<br/>
>><br/>
>><br/>
>> _______________________________________________<br/>
>> Lemon-user mailing list<br/>
>> Lemon-user@lemon.cs.elte.hu<br/>
>> <a href="http://lemon.cs.elte.hu/mailman/listinfo/lemon-user" target="_blank">http://lemon.cs.elte.hu/mailman/listinfo/lemon-user</a><br/>
>><br/>
><br/>
</div>
</div>
</div>
</div></div></body></html>