Currently, it remembers only the last edge inserted or the last edge sampled. This can be inefficient (#239, #547) if the proposal involves multiple toggles or insertions, but their number is relatively small, so HashEL may be overkill.
It should be straightforward to change el->lindex from an integer to a stack that searches the last k elements. k could be set at initialisation.
Currently, it remembers only the last edge inserted or the last edge sampled. This can be inefficient (#239, #547) if the proposal involves multiple toggles or insertions, but their number is relatively small, so
HashELmay be overkill.It should be straightforward to change
el->lindexfrom an integer to a stack that searches the lastkelements.kcould be set at initialisation.@chad-klumb , what do you think?