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

[Casey Hawthorne]

Hi

First
Would using a Bloom Filter work?
Depending on size of filter, one can still get a low percentage of false
positives
I saw Bloom Filters in Rwal World Haskell


Second
I saw the idea of using dictionaries in Python instead of dancing links here

https://www.cs.mcgill.ca/~aassaf9/python/algorithm_x.html

Which should also be applicable to Haskell


On Fri., Jul. 23, 2021, 4:33 p.m. Henning Thielemann, <
lemming at henning-thielemann.de> wrote:

>
> 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
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20210724/8e2952a8/attachment.html>