#17182: random spanning trees using the Aldous-Broder algorithm
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_review
Type: | Milestone: sage-6.4
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers: Nathann Cohen
theory | Work issues:
Keywords: | Commit:
random tree | e0345a9ec9b5e64e1d9f0d66eff279bfd5ea61d2
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
public/17182 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by ncohen):
* commit: 9f04077fa49968c80334d1c2fc58ce46d93febfd =>
e0345a9ec9b5e64e1d9f0d66eff279bfd5ea61d2
* branch: u/chapoton/17182 => public/17182
* reviewer: => Nathann Cohen
Comment:
Hello,
The doc did not compile. I fixed it. A reference was defined twice (once
in `spanning_trees.pyx`, another time in the copy of that function as it
is imported in `graph.py`).
The 'see also' should appear a bit earlier, especially when there is a
'test' section. Otherwise nobody sees it.
I flagged the spanning tree in the doctest as `#random`, because the
vertex ordering can depend on the architecture.
If you agree with the commit I added, please set this ticket to
`positive_review`
Nathann
----
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=e0345a9ec9b5e64e1d9f0d66eff279bfd5ea61d2
e0345a9]||{{{trac #17182: review}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/17182#comment:12>
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.
