#7651: c_graph backends should include a "reversed" copy for digraphs in the
sparse case
----------------------------+-----------------------------------------------
Reporter: rlm | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Comment(by rlm):
I should have pointed out that `self._cg.in_neighbors(v)` would still work
in the case you point out. It's just that using
`self._cg_rev.out_neighbors(v)` is faster when it's available. The point
is that you only have to worry about these things when you're writing a
function in the GraphBackends.
I'm more and more becoming convinced that #7634 is the appropriate place
to break up `graph.py`. It will already be an invasive change to
sage/graphs, and this will encourage people to get their pet patches
merged before the switch. When I break up the file, part of the result
will be a Cython layer, which sits "above" the graph backends. That way,
when people are writing more advanced graph theory functions in Cython,
they can do it there, safely away from the implementation-level stuff
you're talking about.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7651#comment:10>
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.
