Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

olimpo's blog

By olimpo, 14 years ago, In English

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.

Tags tsp
  • Vote: I like it
  • -6
  • Vote: I do not like it

»
14 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Obviously this problem is NP-complete, sow what kind of solution do you expect?