#7184: Implement counting of spanning trees for graphs and digraphs
----------------------------+-----------------------------------------------
Reporter: AJonsson | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.2
Component: graph theory | Keywords:
Work_issues: | Author:
Reviewer: | Merged:
----------------------------+-----------------------------------------------
Comment(by ncohen):
This patch should satisfy all of us, I hope. It includes the last version
of AJonsson's code, and it adds an argument to kirchhoff_matrix so that
the user may chose if D is the matrix of indegree or outdegrees.
I added the corresponding documentation to the kirchhoff_matrix function.
I have to mention that the way kirchhoff_matrix is written contains a lot
of repetitions because of the possibility of different values for the
indegree variable. I thought of other ways to write it to preserve the
code, but these ways could have at some point impaired the performances,
as checks for the values of the variable indegree could have happened much
more often. I write it this way as the function is still very short and
this should not be a problem for its maintenance.
Oh, and the patch is based on 4.1.2.rc0
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7184#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 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
-~----------~----~----~----~------~----~------~--~---
