Nearest Neighbor, in mathematics, is an algorithm meant to determine the relationship between multiple sets of points - used as a way of solving the Traveling Salesman Problem - Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city? In this series, Nearest Neighbor finds us exploring the habitats and domiciles of our neighbors near and far, as a way to familiarize, and show the relevant but subtle differences in our cultures and populations.
