TSP bitmasking program added

[AbhijitDutta338]

Related Issue

• Mention issue for which this pull request is a part of (please mention issue number # )

• 1548

Proposed Changes

• Change 1 - Added Travelling salesman problem in DP section with bitMasking

Additional Info

• Any additional information or context

Checklist

• [x] ✅ My code follows the code style of this project.
• [ ] 📝 My change requires a change to the README.
• [ ] 🎀 I have updated the README accordingly.
• [x] 👀 I have read the CONTRIBUTING document.
• [x] ✨ I have added tests to cover my changes.
• [x] 🚩 All new and existing tests passed.
• [x] 🌟 ed the repo

Added a Travelling salesman solution using DP with bitmasking. Implemented a top-down DP approach that uses a DP Matrix with (2^N) *N dimensions with N being number of cities and 2^N is the total number of permutations of cities that are visted and yet to be visited.

Added a program for TSP with DP & bitmasking.

It is an implementation of TSP solution using DP & bitmasking. Previously, this repository contained an solution for TSP but lacked the bitmasking approach. This pull request aspires to add the same.

1548

https://github.com/Lakhankumawat/LearnCPP/issues/1548

I have used a sample adjacency matrix for testing whether the program is working properly

I used an online C++ compiler for testing my program -> https://www.onlinegdb.com/online_c++_compiler

It does not affect any other areas

• [ ] Bug fix (non-breaking change which fixes an issue)
• [x] New feature (non-breaking change which adds functionality)
• [ ] Breaking change (fix or feature that would cause existing functionality to change)

Output Screenshots

Screenshot #1	Screenshot #2
test -1	test-2

[AbhijitDutta338]

Please review my PR @Lakhankumawat

[github-actions[bot]]

This PR is stale because it has been open 3 days with no activity. Please commit the changes requested or make improvements on the code. Thank you for your contributions!