The travelling salesman problem (TSP) is widely renowned and used all around us in the real world. It involves finding the best path in a graph where distance is minimised. Think of the nodes in the graph as houses, the edges as roads, and you are a delivery driver trying to drop off packages in each home and return to the starting point. This project brings the TSP to life by allowing you to solve it visually using four algorithms: Brute Force, Nearest Neighbor, Greedy, and Christofides.
- Create your own graph by adding and removing nodes - or click "random graph" for a template one
- Add weights to the graph by clicking the edge and input your desired weight
- You can generate random weights too
- Once happy, select the algorithm and visualise it using the media buttons at the bottom of the screen
- If you want to test your understanding of an algorithm, toggle "interactive mode" and select the next step of the algorithm
Before you begin, ensure you have installed Node.js - you can download it from the Node.js official website.
- Clone the repository:
git clone https://github.com/kmousaa/TSP-visualiser.git - Navigate to the Project Directory:
cd TSP-visualiser - Enter the Application Directory:
cd my-app - Install Dependancies:
npm install - Start Server:
npm start
Once both the server and client are running, open your browser and navigate to http://localhost:3000
- 2-opt Algorithm
- Simulated Annealing
- Ant Colony Optimization