#16246: Add functions calculating all spanning trees, all bridges in a graph
-------------------------------------+-------------------------------------
Reporter: jdickinson | Owner:
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-6.3
Component: graph theory | Resolution:
Keywords: bridge, spanning | Merged in:
tree | Reviewers:
Authors: Jennet Dickinson | Work issues:
Report Upstream: N/A | Commit:
Branch: | ee9beee106dbc7c650dbd418ca4ec0090c01cc67
u/jdickinson/ticket/16246 | Stopgaps:
Dependencies: #16307 |
-------------------------------------+-------------------------------------
Comment (by jdickinson):
Hello! Thanks for the feedback. We have been working on addressing your
suggestions
1) Improved documentation coming soon
2) Auxiliary functions have been moved inside the functions we define
3) Our code isn't meant to handle digraphs – have moved everything from
generic_graph.py to graph.py
4) Have replaced our bridges code with yours – it runs faster and avoids
the problem of hitting a max recursion depth
5) Updated spanning_trees no longer includes this line
Jennet
--
Ticket URL: <http://trac.sagemath.org/ticket/16246#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 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.
For more options, visit https://groups.google.com/d/optout.
