Travelling Salesman Problem(TSP) Using Heuristic Search
- There are two modes: Random and Manual. By default, the Random mode loads a random graph.
- "Number of cites" refers to the count of cities displayed in the graph.
- "Start city" allows the user to choose the starting city.
- Press the "Solve" button to initiate the algorithm and start the simulation process.
- The canvas is divided into two sections. The left portion represents the graph, while the right portion displays all the possible paths in a tree structure.
- If the user selects Manual mode, they can create their own graph by clicking on the canvas.
- After creating the graph, enter the start node and click the "Solve" button.
- The algorithm will begin running and show the graph method and the tree method on the canvas.
- To create another graph, click the "Reset" button. This will clear everything, allowing the user to create a new graph.