#10896: Strongly Regular Graph
----------------------------+-----------------------------------------------
Reporter: pgdx | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone:
Component: graph theory | Keywords: srg strongly regular graph
Author: pgdx | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by pgdx):
I don't know if I should add a new patch, so I for now, just add a note
here that we should use the parameter for is_regular, i.e.
{{{
#!python
if k is None:
if not this.is_regular():
return False
else:
if not this.is_regular(k):
return False
}}}
Also, this patch is maybe a bit slower then necessary; We fetch the
neighbourhood of a vertex O(n²) times. This is simply because I don't know
how to get the neighbourhood of a vertex, i.e. the vertices in its
neighbourhood, not the edges it is adjacent to. The neighbourhood could be
fetched in the beginning of the function, but I don't know how we deal
with this kind of allocating a lot of memory.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10896#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
