Re: [Haskell-cafe] What would be the equivalent in Haskell of Knuth's Dancing Links method on a doubly linked circular list?

On Fri, 23 Jul 2021, Casey Hawthorne wrote:

What would be the equivalent in Haskell of Knuth's Dancing Links method on a doubly linked circular list?

I have written the exact set cover solver just with bit manipulation. Linked lists would require much more memory in most cases. https://hackage.haskell.org/package/set-cover