[solved]-Want Solve Formal Statement Traveling Salesman Input Complete Weighted Directed Graph G Ta Q39075666

So I want to solve:

The formal statement of Traveling Salesman:
Input a complete, weighted, directed graph G, and a target integerk
Output true if there is a path through G that
1) visits every vertex exactly once
2) costs <= k

With:

mystery program:

Input: a directed grid graph G, a set of target pointsS, and an integer k

Output: true if there is a path through G that visits all points inS using at most k left turns

A grid graph is a graph where the vertices are atinteger coordinates from 0,0 to n,n. (So 0,0,  0,1, 0,2,  …0,n,  1,0,  etc.) Also, all edges arebetween vertices at distance 1. (So 00->01, 00->10, but not00 to any other vertex. Also some edges could be missing.)

Either give a polynomial time algorithm to solve thisproblem, or prove this problem is NP-hard.

Expert Answer

---

Answer to So I want to solve: The formal statement of Traveling Salesman: Input a complete, weighted, directed graph G, and a targ… . . .