[Lemon-user] Thread safety and other issues

[Zenna Tavares]

Hello there

A few questions:

1. Thread safety of data structures.  I have read this issue
http://lemon.cs.elte.hu/trac/lemon/ticket/224 last modified 15 months ago.
 Has this been resolved, can I run dijisktra's algorithm on the same graph
in parallel?  If not will I need to implement my own graph structure,
dijisktra algorithm or both?

2. From a subset of nods of a graph, I want to find all a pairwise distances
(note: this is AFAIK not the same as Floyd Warshall as I don't look at ALL
nodes in the graph).  At the moment I am running dijisktra's on all pairs
N(N-1)/2 within my subset.  Do you know of any more efficient method?

3. Is lemon::findEdge linear in the number of nodes?  I am using a static
graph, and it seems to be occupying most of my runtime.  (I use it to check
an edge has not already been added, before adding)

4. In my lab we have built a fairly comprehensive complex network analysis
toolkit around the lemon library, we intend to release it soon and hope it
will be useful for others.

Thanks for all the hard work that went into this.

Zenna
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20110511/77505beb/attachment.html>