Travelling Salesman Problem
Very famous problem. Example of an NP-hard problem (idk what this means).
“Given a list of cities (nodes) and the distances between each pair of cities (weighted edges), what is the shortest possible route that visits each city exactly once and returns to the origin city?”