Parallel Programming

This project is to create an algorithm to solve travelling salesman problem (TSP).
The algorithm that is tested in this project:

Result
Orange Circle 👈 Depot
Red Circle 👈 City
Green Square 👈 Parcel

License

This project is for educational purpose.

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
BruteForce		BruteForce
Dynamic Programming With Multi Threaded		Dynamic Programming With Multi Threaded
Images		Images
README.md		README.md