This is Traveling salesman problem solver, implementing Little's algorithm in C++, it is based on a client-server architecture. The server is written in C++ and computes the best path to go to every node only once. The client is a Web GUI which will display the map and will request the server. The communication between the two is made with Web sockets
-
Notifications
You must be signed in to change notification settings - Fork 0
dhawos/TSP-solver
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published