LEMON is thread safe in the common (weak) sense, i.e. each data
structure can safely be accessed in parallel assuming that they do not
modify it (*), and more than one instance of the same algorithms can be
run in parallel, assuming again that they do not alter their input.
Currently, LEMON do not itself provide any parallel algorithm. But - of
course - any contribution is the most welcome.
(*) This requirement is trivial to meet in most cases. A notable
exception is the default graph-map (e.g. ListDigraph::NodeMap<int>).
Allocating a new map logically does not modify the underlying graph,
but - due to the graph alteration notification feature - physically it
does. Thus a locking mechanism is needed for this operation.
On Sun, 2016-09-18 at 13:58 -0700, Ruby Spring wrote:
> First time user here. Are there examples of multi-threaded usage. I
> just see some references to the whole package being thread safe.
> If I want to implement a threaded bfs, I have to reimplement bfs?
> Lemon-user mailing list
Lemon-user mailing list