Travelling Salesman problem (TSP)  Sequential Programming & Parallel Programming (2018)

For the C++ sequential program, it is using brute force or permutation method to find out the shortest distance among all the outcomes.

For the parallel program, it is using windows threading to perform multiple threads for find out the shortest distance faster.

https://video.wixstatic.com/video/c78f45_bb02442c0ab04276a78501c0b0c3fa98/480p/mp4/file.mp4