Problem of smallest distance

There is this fun problem about finding the maximum number of towns to which a particular town can be connected if it can only be connected to the nearest town and no two towns are at the same distance.
To solve this one should observe the word nearest town.