Robert, this question might be mainly to you: I have a need to enumerate all possible black and white colorings of a graph, up to (colored) isomorphism. Is there a way to use some of the NICE code to make this fast? It seems like I read somewhere that Robert was going to generalize NICE to let you compute enumeration/canonical things for more general combinatorial objects.
Thanks, Jason --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
