We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I have been working to implement Kirchhoff's theorem to determine the number of all potential spanning trees. I'm not trying to hard to get the count of minimum spanning trees until I have the total count working. My code produces minors and recursively finds determinants for these minors. I have the code working and getting good test results for 3x3 matrices and 4x4 matrices. I bought the input and expected output for test 01. For this test case there are 10 nodes and 20 edges. I create the initial 10x10 Laplacian matrix, arbitrarily strip the first row and column and send the resulting submatrix to my recursive routine to find the determinant based on all the subsidiary matrices and determinants. For test case 01, my result is 14183. The expected count is 9247. So I'm almost the right order of magnitude. (Any prizes for that?)
Does anyone have any suggestions on how to breakdown and analyze this problem?
Alex vs Fedor
You are viewing a single comment's thread. Return to all comments →
I have been working to implement Kirchhoff's theorem to determine the number of all potential spanning trees. I'm not trying to hard to get the count of minimum spanning trees until I have the total count working. My code produces minors and recursively finds determinants for these minors. I have the code working and getting good test results for 3x3 matrices and 4x4 matrices. I bought the input and expected output for test 01. For this test case there are 10 nodes and 20 edges. I create the initial 10x10 Laplacian matrix, arbitrarily strip the first row and column and send the resulting submatrix to my recursive routine to find the determinant based on all the subsidiary matrices and determinants. For test case 01, my result is 14183. The expected count is 9247. So I'm almost the right order of magnitude. (Any prizes for that?)
Does anyone have any suggestions on how to breakdown and analyze this problem?