private static void SolveGraph(List<City> nodes) { Console.WriteLine("Shortest Path is: "); Console.WriteLine("Greedy"); ITSPSolver tspSolver = new GreedyTSPSolver(); GetSolution(nodes, tspSolver); Console.WriteLine("Genetic"); tspSolver = new GeneticTSPSolver(); GetSolution(nodes, tspSolver); }
public MainWindow() { InitializeComponent(); map = new Map(); graphicsBuilder = new GraphicsBuilder(); graph = new Graph(graphicsBuilder); List<City> cities = map.GetCities(15, 700, 500); graph.Draw(GraphCanvas, cities); GreedyTSPSolver tspSolver = new GreedyTSPSolver(); City start = cities.ElementAt(0); IEnumerable<City> solution = tspSolver.Solve(cities); graph.DrawSolution(GraphCanvas, new[] { start }.Concat(solution.Concat(new[] { start }))); }