Right now I am working on my implementation of the D.Kuth DLX algorithm/data structure.
I know what is exact cover and how Dancing links works. But I have a question on his paper:
On page 5, he describes the implementation of the algorithm. And there, his "data object x" nodes have "C field" that points to the column object at the head of the relevant column. But I don't fully understand why he needs it and how he uses it? And the same goes for the "C filed" for the "column object".
typedef struct Data{
struct Data *left, *right, *up, *down;
struct Column *c;
} Data;
typedef struct Column{
struct Column *left, *right, *up, *down;
struct Data *c;
int size, name;
} Column;