Solve the Travelling Salesman Problem using Ant Colony Optimization. Given a list of cities (as (x, y) coordinates), finds a near-optimal route that visits each city exactly once and returns to the starting city. # Arguments `cities` - Vector of (x, y) coordinate tuples representing city locations `num_ants` - Number of ants per iteration (default: 10) `num_iterations` - Number of iterations to
(
cities: Vec<(f64, f64)>,
num_ants: usize,
num_iterations: usize,
evaporation_rate: f64,
alpha: f64,
beta: f64,
q: f64,
)
source not stored for this graph (policy: none)