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

[ohad barta]

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
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20111010/76e42dff/attachment.html>