| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
how to count the number of spanning trees in a graph?
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.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Mohamed.Sobhy | 2018-12-09 22:48:16 | 63 | (published) | |
| en2 |
|
Mohamed.Sobhy | 2018-12-09 22:46:59 | 104 | ||
| en1 |
|
Mohamed.Sobhy | 2018-12-09 22:41:55 | 242 | Initial revision (saved to drafts) |
