TSP Solver is a very intuitive and user-friendly program that demonstrates two

common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory.

For a brief descr iption of the TSP, along with a quick reference to the solution

methods addressed here, you can have a look at the TSP.pdf that is included. The

user is able to the number of the graph nodes, load random distance values

or even load or save the values to a file. He can the Heuristic Algorithm

or even the computationally unrealistic Exhaustive Algorithm. At the end of the

execution of the selected algorithm, they are shown the time in seconds and the

estimated flops (floating point operations) used for the calculation. The results

can be added to a result list and according to them, they are drawn useful graphics

that help the user to understand and study better the solution to the problem and

its results.-TSP Solver is a very intuitive and user-friendly program that demonstrates two

common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory.

For a brief descr iption of the TSP, along with a quick reference to the solution

methods addressed here, you can have a look at the TSP.pdf that is included. The

user is able to　the number of the graph nodes, load random distance values

or even load or save the values to a file. He can　the Heuristic Algorithm

or even the computationally unrealistic Exhaustive Algorithm. At the end of the

execution of the selected algorithm, they are shown the time in seconds and the

estimated flops (floating point operations) used for the calculation. The results

can be added to a result list and according to them, they are drawn useful graphics

that help the user to understand and study better the solution to the problem and

its results.