how to count the number of spanning trees in a graph?

Revision en3, by Mohamed.Sobhy, 2018-12-09 22:48:16

Hi!

i am trying to solve this problem KPMAZE-Maze on spoj .. which i could summarize to count the number of spanning trees in a small graph (at most 25 nodes)...i tried Kirchhoff Theorem but i couldn't calculate the cofactor of Laplacian matrix..any ideas or code.

Tags #trees, #kirchhoff, #spoj, #graph

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Mohamed.Sobhy 2018-12-09 22:48:16 63 (published)
en2 English Mohamed.Sobhy 2018-12-09 22:46:59 104
en1 English Mohamed.Sobhy 2018-12-09 22:41:55 242 Initial revision (saved to drafts)