Travelling salesman problem program

[papri24majumder]

The traveling salesman problem is a problem that asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" I want to implement this problem in C and Java. Kindly assign me this issue under SWOC @Kumar-laxmi

[Kumar-laxmi]

Assigned! @papri24majumder : C

[mvpamansingh]

@Kumar-laxmi can you please assign this in c++/java

[yashlondhe90960]

@Kumar-laxmi Please assign this for me in Java

[papri24majumder]

@Kumar-laxmi can I add my code file to the existing dynamic programming folder? or should I create another folder?

[Kumar-laxmi]

@Kumar-laxmi can I add my code file to the existing dynamic programming folder? or should I create another folder?

You should put your code in the existing Dynamic Programming folder

[Amit0412]

Pls assign me Travelling salesman program issue in Python language. I have raised the issue.

[Kumar-laxmi]

Assigned! @mvpamansingh : C++ @yashlondhe90960 : Java @Amit0412 : Python

[Amit0412]

Ok I will upload it in python.Thankyou

[Kumar-laxmi]

@Amit0412 @yashlondhe90960 Status??