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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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
ichrysou/tsp-cuda
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published