Hi Reto, I had a closer look at filter() and iterator() of LockableMGraphWrapper. I seems to me that the readlocks done in these methods and the LockableIterator are mostly unnecessary and performance impairing. The LockableIterator locks the graph for every call of next() and hasNext(), but in between calls the graph is not read-locked, therefore a write operation can occur. Because of this a caller of one of these methods has to read-lock the graph while iteratating anyway. I propose to no longer use LockableIterator in filter() and iterator(). What do you think?
Regards, Manuel
