On Wed, Jan 27, 2010 at 08:19:54PM -0800, Chris Godsil wrote: > The usual convention in graph theory is that a Cayley graph does _not_ > have to be connected. > For example it is a basic theorem due to Sabidussi that a graph X is a > Cayley graph for a group G if and > only if G acts regularly on the vertices of X. Since there does not > appear to be a significant cost > in following this convention, I think it should be followed.
> > * Merges cayley_graph with that for FiniteSemigroups. In the > > merging, connecting_set was deprecated to generators. Also Oops, it seems there is an ambiguity in my patch description. The patch surely does not *remove* this useful feature. It just renames the ``connecting_set=...`` option, to ``generators=`` (while temporarily retaining backward compatibility). More on the rationale in my answer to Robert. Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nthi...@users.sf.net> http://Nicolas.Thiery.name/ -- 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