#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 boothby):
Nathann, I was wrong! I've ONLY dealt with Kirchhoff matrices in the
context of electrical networks, in which loops are utterly insignificant.
For me, the definition of the Kirchhoff matrix is that the diagonal is the
row-sum of the weighted adjacency matrix. But, the definition you are
using appears to be standard, and as noted here, more useful.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7184#comment:11>
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
-~----------~----~----~----~------~----~------~--~---
