Corpus ID: 15688462

Dancing links

@inproceedings{Knuth2000DancingL,
  title={Dancing links},
  author={D. Knuth},
  year={2000}
}

• D. Knuth
• Published 2000
• Computer Science

will put x back into the list again. This fact is, of course, obvious, once it has been pointed out. Yet I remember feeling a definite sense of “Aha!” when I first realized that (2) would work, because the values of L[x] and R[x] no longer have their former semantic significance after x has been removed from its list. Indeed, a tidy programmer might want to clean up the data structure by setting L[x] and R[x] both equal to x, or to some null value, after x has been deleted. Danger sometimes… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed