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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
1 | maomao90 | 163 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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