need help with a kirchhoff's theoremhow to count the number of spanning trees in a graph?
Difference between en2 and en3, changed 63 character(s)
Hi!↵
↵
i am trying to solve this problem [KPMAZE-Maze](https://www.spoj.com/problems/KPMAZE/) 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.

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)