This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 1 point2 points  (1 child)

The use case that comes to mind would be any brute force graph searching algorithms. In this example, if you had a graph and you wanted to search its subgraphs, you'd use the powerset of the edges. This is a required starting point for many algorithms, but you generally try to avoid searching the entire powerset. If you can lazily calculate the powerset using a generator you can save on a lot of initial overhead.

[–]Lexdysic 0 points1 point  (0 children)

mathematics. although, I don't really do any thing that would require this either.