#12806: upgrade of spkg networkx-1.2.p2 to 1.6
----------------------------------------+-----------------------------------
Reporter: dkrenn | Owner: jason, ncohen, rlm
Type: defect | Status: new
Priority: major | Milestone: sage-5.1
Component: graph theory | Resolution:
Keywords: spkg networkx graphs | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Daniel Krenn | Merged in:
Dependencies: | Stopgaps:
----------------------------------------+-----------------------------------
Comment (by jlopez):
The failing test in digraph.py is an improvement. In older versions of
NetworkX `topological_sort_recursive` had a problem that has since been
sorted out. The failing test was showcasing a bug that is not there
anymore. This is also good news since we can also expose the recursive
implementation of topological sorts in sage.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12806#comment:6>
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.
