#11046: Some comments in the code of SparseGraph
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: trivial | Milestone: sage-4.7
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
Patch updated... I have been thinking about the graph structure for a
while now... I have had to write some C code for a fast computation of
"all pairs distance" (did you get my email about it ?), and I had to
quickly redefine a Graph in C which lists all of its edges in a contiguous
memory area so that it is optimal to list all edges of a graph.
I also thought that because of the lack of red/black trees you mentionned
in that code, your good implementation is badly misused : very often the
edges of a graph are added in "lexicographical order", and in this case
all your trees are actually linked lists.... But I need to think a bit
more before coming up with a good solution `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11046#comment:4>
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.
