Solving the traveling salesman problem using Simulated Annealing. The output of the algorithm is represented by the SFML graphical library. The solver is implemented in src/TSPsolver.cpp and include/TSPsolver.h. The nodes are stored with x,y coordinates and can be added to the solver with the addNode function. The solve function is used to run the algorithm. The getNodes function returns the nodes as std::vectors.
-
Notifications
You must be signed in to change notification settings - Fork 0
zalandemeter12/TSP-solver
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Simulated Annealing
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published