Implementation of Greedy, Genetic, and A* algorithms in Python for finding the optimal path for a Travelling Salesman Problem