| http://www.w3.org/ns/prov#value | - Jezemine, this should be evidence of that the orignal Travelling Salesman problem is not solvable for all types of paths, ie has no general algorithm to solve all paths.According to the original TSP, each and one city can only be visited once.
|
