Hi Jason, > > I'd like to generate all partially ordered sets of a given cardinality upto > > isomorphisms... They are in bijection with aclyclic, transitively reduced > > directed graphs. Does anyone have an idea how to do that ? I can't manage to > > get this with nauty. > > > I'm sure there's a smarter way, but you could generate acyclic directed > graphs and then transitively reduce them.
Yep ! That's a solution... I'll need then nauty again to remove isomorphic duplicates. I'll probably go far enough for my problem with this methods since the algorithm I want to put behind seems to be vastly exponential in the size of the poset. I hope this will not break my conjecture... By the way, just to know, can this be achieved in plain sage without nauty ? Thanks for your suggestion, Cheers, Florent -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
