Travelling Salesman Problem using Dynamic Programming

[juhiesayyed]

What would you like to Propose?

• The source and destination vertex in the "Travelling Salesman Problem" are the same.
• Example Postmen take letters from the post office and deliver them to various addresses before returning them to the post office.
• For this algorithm, a complete directed graph is necessary.
• Purpose:- Create a path from the source vertex that passes through every vertex of the graph and returns to the source vertex in the shortest amount of time.

Issue details

• There is no algorithm related to the travelling salesman problem in the java/DynamicProgramming folder.
• Considering how well-known this algorithm is, I reasoned that it must be present in this Alorithum repository.

Additional Information

No response

[juhiesayyed]

#hactoberfest-2023

[Vineetttt]

hello @juhiesayyed , can i work on this ?

[sahill-chand]

@juhiesayyed Please assign me this project.I will complete this project in just one day by using comments and appropriate variable names and in most efficient way.Desperately Looking ahead to work with you

[Monachaudhary]

As an active participant in Hacktoberfest, I am eager to take on the assigned issue. I bring with me a commitment to optimizing solutions with the finest space and time complexities. Rest assured, your task is in capable hands. Please assign this issue to me.

[Shobhit0603]

sir can i solve this issue...please assign me this...i want to commit changes

[md-shamim-ahmad]

If anyone has plans to create a PR for Hacktoberfest 2023, then there have awesome leetcode problem list You can create a pull request of your solution for specific problems in this list.

[github-actions[bot]]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

[github-actions[bot]]

Please reopen this issue once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!