#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 | 06d62687aeca758eced0d3605c767cfac5dd985d
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/17182 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Furthermore, all explanations of the `Aldous-Broder` algorithm that I find
mention taking the initial vertex at random, while you always take the
first one.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17182#comment:5>
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.
