#14690: Useless memory allocation in listing neighbors of a graph
--------------------------------------------+-------------------------------
Reporter: vdelecroix | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.11
Component: graph theory | Resolution:
Keywords: sparse graph, allocation | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Vincent Delecroix | Merged in:
Dependencies: | Stopgaps:
--------------------------------------------+-------------------------------
Changes (by vdelecroix):
* status: needs_review => needs_work
Comment:
Replying to [comment:1 vdelecroix]:
> The patch is not yet finished but at least, with it applied, I can build
the `PetersonGraph` and `random_stress` does not complain ;-)
>
> I would like some comments before going further.
The code to remove an edge does not work (`del_arc_unsafe`). I have to
check it more carefully before asking somebody else to review the patch.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14690#comment:2>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
