#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 | 9f04077fa49968c80334d1c2fc58ce46d93febfd
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/17182 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by git):
* commit: c382750f9cd0d08f492d9aed2f35b2410d1f5f24 =>
9f04077fa49968c80334d1c2fc58ce46d93febfd
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=9f04077fa49968c80334d1c2fc58ce46d93febfd
9f04077]||{{{trac #17182 solving the empty graph issue}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/17182#comment:10>
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.
