gephi / graphstore / #614

92%

push

Take the graph lock before the quad tree lock when iterating edges in an area (#323)

The edges-in-area iterator took the quad tree read lock and then the graph read lock, while node add and remove take the quad tree write lock under the graph write lock, so the two could deadlock. doBreak on the edges iterable also released only one quad tree read hold, leaking a second one and the graph read lock. The iterator now takes the graph read lock first and holds a single quad tree read lock, and doBreak releases both.

Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com>

12 of 12 new or added lines in 1 file covered. (100.0%)

12124 of 13239 relevant lines covered (91.58%)

0.92 hits per line