Traveling Salesman Problem ( Dynamic Programming)

#TravelingSalesman #DynamicProgramming #MinCostTour Let G=(V,E) be a directed graph with edge cost Cij defined such that Cij greater than 0 for all i and j and Cij=∞ if (i,j) do not form an edge.Let |V|=n . A tour of G is a directed simple cycle that includes every vertex in V also the source and destination vertex be the same i.e. Vs = Vt. The cost of a tour is the sum of the cost of the edges on the tour. The Traveling Salesman Problem is to find a tour of minimum cost.