#11754: Computation of rank-decompositions in Sage
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Comment(by ncohen):
Hellooooooo David !!
I just updated the patch so that the case n == 0 is checked. This being
said, there is nothing I can do with the segfault you meet as I have not
been able to reproduce it. I read my code several times and try to pay
attention to those memory errors, all the malloc are checked, etc... I am
beginning to think the error may be in the original C code and perhaps it
is not too hard to spot by adding "printf("Hello\n");" at some different
places until we know where the error is coming from.
After this, I can forward the problem to the author and ask for a patch
(and I don't expect this to take too much time either).
The thing is that I really can not debug this without being able to
reproduce the bug. I tried maaaaaaany times t create a random graph and
give it a try but it never happened. Did you tell me that the error
occurred right when the function was called ? And do you know if it
happens "often" ? How many random graphs do you try before it segfaults ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11754#comment:7>
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.
