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
