#18539: faster matroid 3 connectivity
-------------------------------------+-------------------------------------
Reporter: chaoxu | Owner: chaoxu
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: matroid theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/chaoxu/faster_matroid_3_connectivity|
eca042a03f89753c1254d982e0dd663ec7d1b686
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by Rudi):
Hi Chao,
I don't think I should be reviewing your code since Stefan is your mentor
on the gsoc project, but I can help a little.
So I tested your code to see if it would detect a separation if it exist,
using the following:
{{{
def binary_matroid_with_2_separation(r,n):
A=MatrixSpace(GF(2),r,n).random_element()
s = ZZ.random_element(2,r-3)
m = ZZ.random_element(2,n-2)
for i in range(s+1, r):
for j in range(m):
A[i,j] =0
for i in range(s):
for j in range(m, n):
A[i,j] =0
return Matroid(A)
}}}
and
{{{
for i in range(10000):
r=ZZ.random_element(6,20)
n=ZZ.random_element(r+6, 5*r)
M = binary_matroid_with_2_separation(20,50)
if M.is_3connected():
print M
break
}}}
Your code seems to withstand such testing all the time.
Cheers,
Rudi
--
Ticket URL: <http://trac.sagemath.org/ticket/18539#comment:30>
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 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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
