There is a graph (until 100 nodes) I wanted to know how many ways from a node s to t such as the way visit all the nodes in the graph, so instead of normal TSP is count the number of way.
There is a graph (until 100 nodes) I wanted to know how many ways from a node s to t such as the way visit all the nodes in the graph, so instead of normal TSP is count the number of way.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | Petr | 146 |
| 10 | pajenegod | 145 |
Obviously this problem is NP-complete, sow what kind of solution do you expect?
Someone that give the answer for 100 nodes in at most 20s