2020-03-29 14:38:25 +0200 | commented answer | Iterate over Set partitions of given length Indeed, I apologize. I was experimenting with this function as of last night. Thanks! (I guess one mistake was |

2020-03-28 22:22:19 +0200 | asked a question | Iterate over Set partitions of given length (Definition: for a set $S$, and a partition $P=\{P_1,P_2,\ldots,P_k\}$ of $S$, we say that the I want to iterate over all partitions of $S$ whose length is $k$.
If it helps, for traditional (proper) graph coloring there is an iterator that does precisely the type of thing I am looking for; it is called |

2020-03-28 22:00:27 +0200 | received badge | ● Popular Question (source) |

2019-04-17 19:37:41 +0200 | received badge | ● Scholar (source) |

2017-05-17 18:11:24 +0200 | asked a question | Iterate over acyclic subdigraphs I have a graph My current best bet is to iterate over all permutations of the vertex set of D and, for each one, create an acyclic digraph A by going through each edge of D in turn and adding to A only those edges But this seems awfully inefficient. More precisely: Any ideas would be greatly appreciated. |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.