[Lemon-user] Is LEMON library match my needs?

[Kovács Péter]

Hi,

We don't have comprehensive benchmark reports directly for the aspects 
you mentined. However, some of them were covered in our previous 
studies. For example, "The time it takes to query a label" is essential 
in many graph algorithms, so LEMON maps are designed to be as effective 
as using an array/vector. Anyway, I do not remember any performance 
aspect in which BGL turned out to be superior to LEMON in our experiments.

If you still have doubts about using LEMON, I encourage you to compare 
BGL and LEMON directly in the aspects you are interested in (using your 
particular input data). If you make such experiments, please let us know 
the results.

 > Do you have a special treat for routing or de bruijn graphs?

No, we don't.

Best regards,
Peter


On 2011.10.16. 9:56, ohad barta wrote:
> hello?
>
> On Mon, Oct 10, 2011 at 12:01 PM, ohad barta <sohadb1357 at gmail.com
> <mailto:sohadb1357 at gmail.com>> wrote:
>
>     Hi
>     Im a technion research assistant and I sholuld choose a graph
>     library to work with. I saw your presentation that shows that this
>     library works faster then BGL in many aspects and got imppressed,
>     but Im curious to know if you comparted this library performance to
>     the BGL performance in aspects that will be more relevant for me:
>     *The time it takes to create a huge graph
>     *The time it takes to label vertexes in BGL, vs the time it takes to
>     create corresponding map at lemon.
>     *The time it takes to query a label.
>     *The memory consuming of a labeled\unlabeled graph structure
>     In particular, Im going to use graphs for routing (i.e. : express a
>     permutation as a disjoint paths on a de bruijn graphs). Do you have
>     a special treat for routing or de bruijn graphs?
>     Thanks in advance
>     Ohas Barta
>
>