I did look for a method for checking if a graph is simple using a google search of the documentation, but has_multiple_edges() did not show up. How do you think one should change the documentation (I guess that would be a different ticket).
Anyway, I ran tests on some smaller graphs and noticed an order of magnitude speed improvement. But in some sense, these two algorithms are not solving the same problem exactly, because this one needs the edge labels to be correct. Finally, I changed to is_deterministic() and used has_multiple_edges() as suggested by you. Amri. On Thursday, November 10, 2016 at 12:48:24 PM UTC+5:30, Jori Mäntysalo wrote: > > On Wed, 9 Nov 2016, Amritanshu Prasad wrote: > > > Yes, I have. It's all on a trac ticket: > > > > https://trac.sagemath.org/ticket/21729 > > OK. The code seems to be clear. However, there is already > has_multiple_edges() on (di)graphs, so "is_simple"-part is not needed. Did > you search for a function to check if a graph is simple? If so, and did > not found this, then the documentation of has_multiple_edges() should be > enchanced. > > Is "is_simple_deterministic" meant to be used as it's own? If not, it can > be made a subfunction to is_cayley_directed. Kind of middle solution is to > make it _is_simple_deterministic(), so it won't show up in > <tab>-completion or html documentation. > > is_cayley_directed() has no explanation of what is a Cayley graph. > > I haven't read the paper, so I can not comment about the idea. > > -- > 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.
