Mohamed.Sobhy's blog

By Mohamed.Sobhy, history, 5 weeks ago, In English,

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.

 
 
 
 
  • Vote: I like it  
  • +6
  • Vote: I do not like it  

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by mohamedsobhi777 (previous revision, new revision, compare).

»
5 weeks ago, # |
  Vote: I like it +27 Vote: I do not like it
  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Like..it doesn't work with me..maybe I should try backtracking

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      Maybe this presents the theorem in a more friendly/easier way.