#7640: shortest_path should not use NetworkX if the underlying graph is a
c_graph
----------------------------+-----------------------------------------------
Reporter: rlm | Owner: rlm
Type: defect | Status: needs_work
Priority: major | Milestone: sage-4.3
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Comment(by rlm):
Replying to [comment:12 ncohen]:
> I'll take a look at those errors immediately.
>
> shortest_paths is but a slight modification of this function, but as it
needs to be very fast I wondered about copying most of the code and adding
the necessary details.. What's you advice ?
>
> Nathann
I would think about using the same code. Or factoring it out so that the
redundant parts get written only once. (I don't know how familiar you are
with Cython, but you can use `inline` in situations like these!)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7640#comment:13>
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.
