#7184: Implement counting of spanning trees for graphs and digraphs
----------------------------+-----------------------------------------------
Reporter: AJonsson | Owner: rlm
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-4.2.1
Component: graph theory | Keywords:
Work_issues: | Author:
Reviewer: | Merged:
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_review => positive_review
Comment:
Well, I'll take your "Looks really nice. I'm fully satisfied with the
patch" as as an answer :-)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7184#comment:17>
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
-~----------~----~----~----~------~----~------~--~---
