Revision as of 22:02, 10 July 2006 edit Rob Zako (talk \| contribs) 328 edits →Example: Correct details of example, reformat to show levels, reformat to better show remaining rows and columns ← Previous edit		Revision as of 22:08, 10 July 2006 edit undo Rob Zako (talk \| contribs) 328 edits Add "Implementations" section, correct typo Next edit →
Line 143: :: There are no more selected rows at level 2, thus the algorithm moves to the next branch at level 1. : There are no more selected rows at level 21, thus the algorithm moves to the next branch at level 0. The algorithm is complete. In summary, the algorithm determines there is only one exact cover: <math>\mathcal{S}^*</math> = {''B'', ''D'', ''F''}. == Implementations == [[Donald Knuth\|Knuth]] further suggested an implementation of Algorithm X using circular [[doubly linked list\|doubly-linked list]]s, which he calls [[Dancing Links]], or DLX. == References ==

Knuth's Algorithm X: Difference between revisions