#7184: Implement counting of spanning trees for graphs and digraphs [with patch,
needs review]
-------------------------------------------+--------------------------------
Reporter: AJonsson | Owner: rlm
Type: enhancement | Status: closed
Priority: major | Milestone: sage-4.3
Component: graph theory | Resolution: fixed
Keywords: | Work_issues:
Author: Anders Jonsson, Nathann Cohen | Upstream: N/A
Reviewer: Mike Hansen | Merged: sage-4.3.rc0
-------------------------------------------+--------------------------------
Changes (by newvalueoldvalue):
* status: needs_review => closed
* author: => Anders Jonsson, Nathann Cohen
* upstream: => N/A
* reviewer: => Mike Hansen
* resolution: => fixed
* merged: => sage-4.3.rc0
Comment:
Looks good to me.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7184#comment:20>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
