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 | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
8 | luogu_official | 150 |
10 | awoo | 148 |
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.
Название |
---|
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