Parallel Programming

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

• BruteForce Method.
• Dynamic Programming MultiThreaded Method.

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

License

This project is for educational purpose.