Question: Implement the Traveling Salesman problem using i) Depth first search ii) Greedy search the input should provide start and goal states, and any states in
Implement the Traveling Salesman problem using
i) Depth first search
ii) Greedy search
the input should provide start and goal states, and any states in between as well as cost of traversing path. The final path should be traced from start to goal state.
implement this in python or java
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
