#17182: random spanning trees using the Aldous-Broder algorithm
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_work
Type: | Milestone: sage-6.4
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
random tree | c382750f9cd0d08f492d9aed2f35b2410d1f5f24
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/17182 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by chapoton):
I have a problem with the empty graph, but I do not see what is wrong with
my code.
Another question : do you think I should raise an exception for the empty
graph ? Does it have one spanning tree or none ? I would go for none.
I have also corrected Graph().spanning_trees(), that was failing also. It
now says that the empty graph has no spanning tree, which is coherent with
spanning_trees_count.
--
Ticket URL: <http://trac.sagemath.org/ticket/17182#comment:9>
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.
