Yes, I have. It's all on a trac ticket: https://trac.sagemath.org/ticket/21729
On Tuesday, November 8, 2016 at 4:15:41 PM UTC+5:30, Jori Mäntysalo wrote: > > On Mon, 7 Nov 2016, Amritanshu Prasad wrote: > > > I implemented a new algorithm for checking if a directed graph with edge > > labels is Cayley. It is sensitive to the edge labels, works only for > > directed graphs, but is a much simpler algorithm overall. > > Good. > > Have you written documentation with some examples? Is it on a worksheet, > or already integrated as a part of Sage code? > > Have you tested that it is faster than what Sage currently have? > > -- > Jori Mäntysalo > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
