| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3650 |
| 2 | Benq | 3582 |
| 3 | Geothermal | 3570 |
| 3 | orzdevinwang | 3570 |
| 5 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3532 |
| 8 | Radewoosh | 3522 |
| 9 | Um_nik | 3483 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| 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) |
