Group project for CS441(AI) Genetic algorithm written to solve the traveling salesman problem Given 9 cities and the distances between each city in a matrix Pop size set to 1000 Generations set to 30 Mutation swaps 2 random places of cities in a child Written in c++