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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.
Name |
---|
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