/tsp-cuda

This program finds solution to the TSP problem by calculating all possible routes among N nodes. Utilizes factorial representation of thread number to compute all possible permutations. Final result is printed in command line

Primary LanguageCuda

tsp-cuda: Travelling Salesman Problem solution using CUDA

This program finds solution to the TSP problem by calculating all possible routes among N nodes. Utilizes factorial representation of thread number to compute all possible permutations. Final result is printed in command line Bruteforce implementation on CUDA framework of NVIDIA GPUs.