id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
7184,Implement counting of spanning trees for graphs and digraphs,AJonsson,rlm,"This patch allows us to count the number of spanning trees in a simple graph, as well as the spanning out-trees from a user-defined root node in a digraph.
Method used: Kirchhoff's matrix tree theorem [1] and the Laplacian matrix for the simple graphs, and a variation of the same [2] in the directed case.
[1] http://en.wikipedia.org/wiki/Kirchhoff%27s_theorem [[BR]]
[2] corollary 4.4 in http://books.google.se/books?id=vbxdqhDKOSYC&printsec=frontcover&hl=en&source=gbs_navlinks_s",enhancement,closed,major,sage-4.3,graph theory,fixed,,boothby,sage-4.3.rc0,"Anders Jonsson, Nathann Cohen",Mike Hansen,N/A,,,,,